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

共 6 条

[1] A heuristic algorithm for two-machine re-entrant shop scheduling
Drobouchevitch, IG
Strusevich, VA
[J]. ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 417 - 439
[2] The complexity of cyclic shop scheduling problems
Hall, NG
Lee, TE
Posner, ME
[J]. JOURNAL OF SCHEDULING, 2002, 5 (04) : 307 - 327
[3] Performance measures and schedules in periodic job shops
Lee, TE
Posner, ME
[J]. OPERATIONS RESEARCH, 1997, 45 (01) : 72 - 91
[4] V-SHOP SCHEDULING
LEV, V
ADIRI, I
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 18 (01) : 51 - 56
[5] STEINER G, 2004, MINIMIZING CYCLE TIM
[6] Minimizing makespan in a class of reentrant shops
Wang, MY
Sethi, SP
VandeVelde, SL
[J]. OPERATIONS RESEARCH, 1997, 45 (05) : 702 - 712

← 1 →