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 条
  • [31] Permutation flow shop scheduling with earliness and tardiness penalties
    Chandra, Pankaj
    Mehta, Peeyush
    Tirupati, Devanath
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (20) : 5591 - 5610
  • [32] Hybrid quantum algorithm for permutation flow shop problem
    Fu, Jiaqi
    Ye, Chunming
    Zhu, Lulu
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON SYSTEM MANAGEMENT, 2008, : 323 - 327
  • [33] Lot streaming Permutation Flow shop with energy awareness
    D'Amico, F.
    Rossit, D. A.
    Frutos, M.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT, 2021, 12 (01): : 25 - 36
  • [34] A local search method for permutation flow shop scheduling
    Huang, W. Q.
    Wang, L.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (10) : 1248 - 1251
  • [35] Anomalies in Special Permutation Flow Shop Scheduling Problems
    Lin Gui
    Liang Gao
    Xinyu Li
    Chinese Journal of Mechanical Engineering, 2020, 33 (03) : 61 - 67
  • [36] An Ant Colony Algorithm for Permutation Flow Shop Problem
    Shang, Ke
    Feng, Zuren
    Ke, Liangjun
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 596 - 600
  • [37] RULE BASED HEURISTIC APPROACH FOR MINIMIZING TOTAL FLOW TIME IN PERMUTATION FLOW SHOP SCHEDULING
    Rathinam, Balasundaram
    Govindan, Kannan
    Neelakandan, Baskar
    Raghavan, Siva Sankar
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2015, 22 (01): : 25 - 32
  • [38] An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion
    Fernando Luis Rossi
    Marcelo Seido Nagano
    Juliana Keiko Sagawa
    The International Journal of Advanced Manufacturing Technology, 2017, 90 : 93 - 107
  • [39] An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion
    Rossi, Fernando Luis
    Nagano, Marcelo Seido
    Sagawa, Juliana Keiko
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 90 (1-4): : 93 - 107
  • [40] Permutation Flow Shop Scheduling With Delay Time Under Time-Of-Use Electricity Tariffs
    Cheng, Xingrui
    Gao, Feng
    Yan, Chaobo
    Guan, Xiaohong
    Liu, Kun
    Chen, Siyun
    Yao, Nana
    Cai, Jing
    PROCEEDINGS OF THE 2016 12TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2016, : 2743 - 2748
12345