咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献
  • 2 篇 会议

馆藏范围

  • 15 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
  • 8 篇 工学
    • 7 篇 计算机科学与技术...
    • 3 篇 机械工程
    • 2 篇 电气工程
    • 1 篇 控制科学与工程
  • 6 篇 理学
    • 6 篇 数学
  • 1 篇 军事学

主题

  • 15 篇 robotic scheduli...
  • 8 篇 cyclic schedulin...
  • 4 篇 complexity
  • 3 篇 polynomial algor...
  • 2 篇 no-wait
  • 2 篇 graph-theoretic ...
  • 2 篇 polynomial model...
  • 2 篇 scheduling
  • 2 篇 efficient algori...
  • 1 篇 multi-cyclic sch...
  • 1 篇 method of prohib...
  • 1 篇 subject classifi...
  • 1 篇 cyclic schedulin...
  • 1 篇 bernoulli number...
  • 1 篇 conflict-free
  • 1 篇 networks/graphs
  • 1 篇 task analysis
  • 1 篇 cyclic flowshop
  • 1 篇 assignment probl...
  • 1 篇 polynomial time ...

机构

  • 6 篇 inst ind math be...
  • 3 篇 holon inst techn...
  • 2 篇 inst ind math il...
  • 2 篇 holon inst techn...
  • 1 篇 holon & bar ilan...
  • 1 篇 bar ilan univ de...
  • 1 篇 inst ind math il...
  • 1 篇 univ technol tro...
  • 1 篇 nw polytech univ...
  • 1 篇 univ sci & techn...
  • 1 篇 bar ilan univ il...
  • 1 篇 holon acad inst ...
  • 1 篇 northwestern pol...
  • 1 篇 holon & bar dan ...
  • 1 篇 univ la laguna t...
  • 1 篇 univ calif san d...
  • 1 篇 ben gurion univ ...
  • 1 篇 technion israel ...
  • 1 篇 bar ilan univ ho...
  • 1 篇 univ groningen g...

作者

  • 10 篇 levner eugene
  • 10 篇 kats vladimir
  • 3 篇 kats v
  • 3 篇 levner e
  • 2 篇 che ada
  • 1 篇 alcaide david
  • 1 篇 chu chengbin
  • 1 篇 cheng t. c. e.
  • 1 篇 zang nan
  • 1 篇 alcaide lopez de...
  • 1 篇 luo lei
  • 1 篇 graham ron
  • 1 篇 zhao ning
  • 1 篇 sierksma gerard
  • 1 篇 tang longwei
  • 1 篇 sun yangjun

语言

  • 11 篇 英文
  • 4 篇 其他
检索条件"主题词=robotic scheduling"
15 条 记 录,以下是1-10 订阅
排序:
Breaking the Limit on the Number of Robots Through the Conflict-Free scheduling in robotic Mobile Fulfillment Systems
收藏 引用
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2025年 22卷 7324-7334页
作者: Sun, Yangjun Zhao, Ning Tang, Longwei Luo, Lei Univ Sci & Technol Beijing Sch Mech Engn Beijing 100083 Peoples R China
The robotic mobile fulfillment system (RMFS) utilizes robots to automate logistics handling. Although robots can replace workers, there are serious limitations and conflicts that make the system inefficient, resulting... 详细信息
来源: 评论
A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年 第1期209卷 51-56页
作者: Kats, Vladimir Levner, Eugene Holon Inst Technol IL-58102 Holon Israel Inst Ind Math IL-84641 Beer Sheva Israel Bar Ilan Univ IL-52900 Ramat Gan Israel
Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave... 详细信息
来源: 评论
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第2期157卷 339-355页
作者: Kats, Vladimir Levner, Eugene Holon Inst Technol IL-58102 Holon Israel Inst Ind Math IL-84105 Beer Sheva Israel
In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to rind ... 详细信息
来源: 评论
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第47-49期410卷 5188-5190页
作者: Che, Ada Kats, Vladimir Levner, Eugene Holon & Bar Ilan Univ Holon Inst Technol Ramat Gan Israel NW Polytech Univ Xian 710072 Peoples R China Inst Ind Math Beer Sheva Israel
Recently, Pablo Saez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solv... 详细信息
来源: 评论
Cyclic scheduling in robotic Flowshops with Bounded Work-in-Process Levels
收藏 引用
NAVAL RESEARCH LOGISTICS 2011年 第1期58卷 1-16页
作者: Che, Ada Kats, Vladimir Levner, Eugene Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China Inst Ind Math Beer Sheva Israel Holon Inst Technol Holon Israel Bar Ilan Univ Ramat Gan Israel
This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that... 详细信息
来源: 评论
Cyclic Flowshop scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions
收藏 引用
JOURNAL OF scheduling 2012年 第4期15卷 419-425页
作者: Kats, Vladimir Levner, Eugene Bar Ilan Univ Dept Management Ramat Gan Israel Inst Ind Math Beer Sheva Israel
This note discusses the pioneering role and main contributions of V.S. Tanaev in the field of cyclic robotic flowshop scheduling. Open questions (either explicitly or implicitly) posed in his papers and kept unsolved ... 详细信息
来源: 评论
Parametric algorithms for 2-cyclic robot scheduling with interval processing times
收藏 引用
JOURNAL OF scheduling 2011年 第3期14卷 267-279页
作者: Kats, Vladimir Levner, Eugene Holon Inst Technol IL-58102 Holon Israel Inst Ind Math IL-84641 Beer Sheva Israel
Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter ... 详细信息
来源: 评论
Complexity of cyclic scheduling problems: A state-of-the-art survey
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2010年 第2期59卷 352-361页
作者: Levner, Eugene Kats, Vladimir Alcaide Lopez de Pablo, David Cheng, T. C. E. Holon Inst Technol Holon Israel Inst Ind Math Beer Sheva Israel Univ La Laguna Tenerife Spain Hong Kong Polytech Univ Kowloon Hong Kong Peoples R China
In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flow-shop, an... 详细信息
来源: 评论
The Howard-Romanovskii Routing Algorithm Revisited, with Applications to Robot scheduling
The Howard-Romanovskii Routing Algorithm Revisited, with App...
收藏 引用
International Conference on Computers and Industrial Engineering (CIE39)
作者: Kats, Vladimir Levner, Eugene Inst Ind Math Beer Sheva Israel Holon & Bar Dan Univ Holon Inst Technol Ramat Gan Israel
We consider the original routing algorithm invented by Romanovskii (1967) for solving a cyclic project scheduling problem and establish its close relationship with the well-known routing algorithm by Dantzig, Blattner... 详细信息
来源: 评论
Enumerating split-pair arrangements
收藏 引用
JOURNAL OF COMBINATORIAL THEORY SERIES A 2008年 第2期115卷 293-303页
作者: Graham, Ron Zang, Nan Univ Calif San Diego Dept Comp Sci La Jolla CA 92093 USA
An arrangement of the multi-set {1, 1, 2, 2, ... , n, n} is said to be "split-pair" if for all i < n, between the two occurrences of i there is exactly one i + 1. We enumerate the number of split-pair arr... 详细信息
来源: 评论