Flow shop vs. permutation shop with time delays

被引：14
|
作者：
Rebaine, D [1 ]
机构：
[1] Univ Quebec, Dept Informat & Math, Chicoutimi, PQ, Canada
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2005年 / 48卷 / 02期
基金：
加拿大自然科学与工程研究理事会;
关键词：
flow shop; permutation schedules; makespan;
D O I：
10.1016/j.cie.2005.01.019
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper considers the evaluation of the worst-case performance ratio between the best solution of the flow shop problem and the permutation flow shop with time delays considerations. It is observed that, even in the restricted case of two machines and unit execution time operations, the two models may generate different optimal values for the makespan. More specifically, it is shown that, in the two-machine case, the performance ratio between the best permutation schedule and the best flow shop schedule is bounded by 2. When the operations of the n jobs are restricted to be unit execution time, this ratio is reduced to (2 - (3/n + 2)) for the two-machine case, and is m for the m-machine case. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：357 / 362
页数：6
相关论文
共 50 条
  • [41] A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
    Rossit, Daniel A.
    Vasquez, Oscar C.
    Tohme, Fernando
    Frutos, Mariano
    Safe, Martin D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (03) : 841 - 854
  • [42] Critical paths of non-permutation and permutation flow shop scheduling problems
    Alejandro Rossit, Daniel
    Tohme, Fernando
    Frutos, Mariano
    Safe, Martin D.
    Vasquez, Oscar C.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2020, 11 (02) : 281 - 298
  • [43] A real-time order acceptance and scheduling approach for permutation flow shop problems
    Rahman, Humyun Fuad
    Sarker, Ruhul
    Essam, Daryl
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (02) : 488 - 503
  • [44] A new heuristic for minimizing total completion time objective in permutation flow shop scheduling
    Laha, Dipak
    Chakravorty, Arindam
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (9-12): : 1189 - 1197
  • [45] Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 527 - 533
  • [46] An improved lower bound for the blocking permutation flow shop with total completion time criterion
    Nagano, Marcelo Seido
    Silva Robazzi, Joao Vitor
    Tomazella, Caio Paziani
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 146
  • [47] A new heuristic for minimizing total completion time objective in permutation flow shop scheduling
    Dipak Laha
    Arindam Chakravorty
    The International Journal of Advanced Manufacturing Technology, 2011, 53 : 1189 - 1197
  • [48] Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
    Belabid, Jabrane
    Aqil, Said
    Allali, Karam
    JOURNAL OF APPLIED MATHEMATICS, 2020, 2020
  • [49] Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
    Peter Brucker
    Sigrid Knust
    T.C. Edwin Cheng
    Natalia V. Shakhlevich
    Annals of Operations Research, 2004, 129 : 81 - 106
  • [50] A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop
    Zhou, Tao
    Luo, Liang
    Ji, Shengchen
    He, Yuanxin
    BIOMIMETICS, 2023, 8 (06)
12345