On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
暂无分享,去创建一个
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.
[1] V. A. Strusevich,et al. A heuristic algorithm for two‐machine re‐entrant shop scheduling , 1999, Ann. Oper. Res..
[2] TAE-EOG LEE,et al. Performance Measures and Schedules in Periodic Job Shops , 1997, Oper. Res..
[3] M. Y. Wang,et al. Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..
[4] I. Adiri,et al. V-shop scheduling , 1984 .
[5] Tae-Eog Lee,et al. The complexity of cyclic shop scheduling problems , 2002 .