A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

被引：36
|
作者：
Kats, V
Levner, E
机构：
[1] Ctr Technol Educ, Dept Comp Syst, IL-58102 Holon, Israel
[2] Ben Gurion Univ Negev, Dept Ind Engn & Management, IL-84105 Beer Sheva, Israel
来源：
OPERATIONS RESEARCH LETTERS | 1997年 / 21卷 / 04期
关键词：
production/scheduling; cyclic scheduling; optimization;
D O I：
10.1016/S0167-6377(97)00036-9
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle. (C) 1997 Elsevier Science B.V.
引用
收藏
页码：171 / 179
页数：9
相关论文
共 50 条
  • [41] Influence of no-wait and time lag constraints in flowshop scheduling systems
    Hipp, Andreas
    Fernandez-Viagas, Victor
    [J]. PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 796 - 801
  • [42] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
  • [43] No-wait or no-idle permutation flowshop scheduling with dominating machines
    Wang J.-B.
    Xia Z.-Q.
    [J]. Journal of Applied Mathematics and Computing, 2005, 17 (1-2) : 419 - 432
  • [44] Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
    Che, Ada
    Chu, Chengbin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (01) : 77 - 88
  • [45] Minimizing makespan for a no-wait flowshop using genetic algorithm
    IMRAN ALI CHAUDHRY
    ABDUL MUNEM KHAN
    [J]. Sadhana, 2012, 37 : 695 - 707
  • [46] Intelligent Valid Inequalities for No-Wait Permutation Flowshop Scheduling Problems
    Yuksel, Damla
    Kandiller, Levent
    Tasgetiren, Mehmet Fatih
    [J]. INTELLIGENT AND FUZZY SYSTEMS: DIGITAL ACCELERATION AND THE NEW NORMAL, INFUS 2022, VOL 1, 2022, 504 : 914 - 922
  • [47] No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
    Mucha, Marcin
    Sviridenko, Maxim
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 769 - 779
  • [48] Properties of two-machine no-wait flowshop scheduling problems
    Chen, Ke-Jia
    Wang, Xiao
    [J]. Kongzhi yu Juece/Control and Decision, 2013, 28 (10): : 1502 - 1506
  • [49] Scheduling a No-Wait Hybrid Flowshop in a Real-Time Environment
    Xuan Hua
    [J]. PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS A-C, 2008, : 375 - 378
  • [50] A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
    Gao, Yu
    Wang, Ziyue
    Gao, Liang
    Li, Xinyu
    [J]. SYMMETRY-BASEL, 2022, 14 (05):
12345