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

被引：0
作者：
George Steiner
Zhihui Xue
机构：
[1] McMaster University,Management Science and Information Systems
[2] Canadian Imperial Bank of Commerce,undefined
来源：
Journal of Scheduling | 2006年 / 9卷
关键词：
Job shop; Reentrant flow shop; Cycle time; Makespan; Algorithms and complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：6
相关论文
共 12 条
  • [1] Drobouchevitch I. G.(1999)A heuristic algorithm for two-machine re-entrant shop scheduling Annals of Operations Research 86 417-439
  • [2] Strusevich V. A.(2002)The complexity of cyclic shop scheduling problems Journal of Scheduling 5 307-327
  • [3] Hall N. G.(1997)Performance measures and schedules in periodic job shops Operations Research 45 72-91
  • [4] Lee T.-E.(1984)V-shop scheduling European Journal of Operational Research 18 51-56
  • [5] Posner M. E.(1997)Minimizing makespan in a class of reentrant shops Operations Research 45 702-712
  • [6] Lee T.-E.(undefined)undefined undefined undefined undefined-undefined
  • [7] Posner M. E.(undefined)undefined undefined undefined undefined-undefined
  • [8] Lev V.(undefined)undefined undefined undefined undefined-undefined
  • [9] Adiri I.(undefined)undefined undefined undefined undefined-undefined
  • [10] Wang M. Y.(undefined)undefined undefined undefined undefined-undefined
12