On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

被引：5
|
作者：
Steiner, George [1 ]
Xue, Zhihui
机构：
[1] McMaster Univ, Hamilton, ON L8S 4M4, Canada
[2] Canadian Imperial Bank Commerce, Toronto, ON, Canada
来源：
JOURNAL OF SCHEDULING | 2006年 / 9卷 / 04期
关键词：
job shop; reentrant flow shop; cycle time; makespan; algorithms and complexity;
D O I：
10.1007/s10951-006-7041-z
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Hall et al. (J. Sched. 2002; 5:307-327) investigated the cycle time minimization problem in a two-machine job shop, where each job consists of at most three operations. In this note, we reduce the problem to a two-machine reentrant flow shop problem and briefly discuss some consequences.
引用
收藏
页码：381 / 387
页数：7
相关论文
共 50 条
  • [21] Mathematical Models of Flow Shop and Job Shop Scheduling Problems
    Seda, Milos
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 122 - 127
  • [22] The robust cyclic job shop problem
    Hamaz, Idir
    Houssin, Laurent
    Cafieri, Sonia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 312 (03) : 855 - 865
  • [23] Recurrent neural network approach for cyclic job shop scheduling problem
    Kechadi, M-Tahar
    Low, Kok Seng
    Goncalves, G.
    JOURNAL OF MANUFACTURING SYSTEMS, 2013, 32 (04) : 689 - 699
  • [24] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Topaloglu, Seyda
    Kilincli, Gamze
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (7-8): : 781 - 794
  • [25] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Seyda Topaloglu
    Gamze Kilincli
    The International Journal of Advanced Manufacturing Technology, 2009, 44 : 781 - 794
  • [26] IMOEA/D to optimize job release problem for a reentrant hybrid flow shop
    Yan, Xiaoyan
    Wu, Xiuli
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 163
  • [27] Cyclic job shop scheduling problems with blocking
    Peter Brucker
    Thomas Kampmeyer
    Annals of Operations Research, 2008, 159 : 161 - 181
  • [28] Cyclic job shop scheduling problems with blocking
    Brucker, Peter
    Kampmeyer, Thomas
    ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 161 - 181
  • [29] Connection between the bump number problem and flow-shop scheduling with precedence constraints
    Steiner, G., 1600, (20):
  • [30] Optimal scheduling of AGVs in a reentrant blocking job-shop
    Heger, Jens
    Voss, Thomas
    11TH CIRP CONFERENCE ON INTELLIGENT COMPUTATION IN MANUFACTURING ENGINEERING, 2018, 67 : 41 - 45
12345