The flow shop problem with no-idle constraints: A review and approximation

被引：33
|
作者：
Goncharov, Yaroslav [1 ]
Sevastyanov, Sergey [1 ]
机构：
[1] Novosibirsk State Univ, Sobolev Inst Math, Novosibirsk 630090, Russia
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 196卷 / 02期
关键词：
Combinatorial optimization; Scheduling; Flow shop; Approximation algorithm; VECTOR SUMMATION; MAKESPAN; MACHINE;
D O I：
10.1016/j.ejor.2008.03.039
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The makespan minimization problem in flow shops with no-idle constraints on machines is considered. The latter means that each machine, once started, must process all its operations without intermediate idle time until all those operations are completed. The problem is known to be strongly NP-hard already for three machines. While being based on a geometrical approach, we propose several polynomial time heuristics (for the general case and for special cases of 3 and 4 machines) which provide asymptotically optimal solutions for the increasing number of jobs. A comprehensive review of relevant results is also presented. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：450 / 456
页数：7
相关论文
共 50 条
  • [1] A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem
    Utama D.M.
    Al Imron C.N.
    [J]. Operations Research Forum, 5 (1)
  • [2] Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    [J]. IEEE SYSTEMS JOURNAL, 2019, 13 (02): : 1945 - 1956
  • [3] Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
    Zhou, Yongquan
    Chen, Huan
    Zhou, Guo
    [J]. NEUROCOMPUTING, 2014, 137 : 285 - 292
  • [4] A Discrete Sine Optimization Algorithm for No-Idle Flow-Shop Scheduling Problem
    Zhao, Rui
    Gu, Xingsheng
    [J]. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2020, 54 (12): : 1291 - 1299
  • [5] Mixed no-idle permutation flow shop scheduling problem based on gravitational search algorithm
    Zhao, Rui
    Gu, Xingsheng
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (07): : 1909 - 1917
  • [6] Permutation, no-wait, no-idle flow shop problems
    Makuchowski, Mariusz
    [J]. ARCHIVES OF CONTROL SCIENCES, 2015, 25 (02): : 189 - 199
  • [7] An algorithm based on discrete shuffled frog leaping for No-idle permutation flow shop scheduling problem
    Wang, Ya-Min
    Ji, Jun-Zhong
    Pan, Quan-Ke
    [J]. Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2010, 36 (01): : 124 - 130
  • [8] Harmony Search Algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem
    Ren, Wen-Juan
    Duan, Jun-Hua
    Zhang, Feng-rong
    Han, Hong-yan
    Zhang, Min
    [J]. 2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 2513 - +
  • [9] Evolutionary heuristic for makespan minimization in no-idle flow shop production systems
    Nagano, Marcelo Seido
    Soriano Sampaio Januario, Joao Carlos
    [J]. ACTA SCIENTIARUM-TECHNOLOGY, 2013, 35 (02) : 271 - 278
  • [10] Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
    Cheng, MingBao
    Sun, ShiJie
    He, LongMin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (01) : 115 - 124
12345