A cyclical search for the two machine flow shop and open shop to minimise finishing time

被引：12

作者：

Soper, Alan J. ^{[1
]}

机构：

[1] Univ Greenwich, Old Royal Naval Coll, Sch Comp & Math Sci, London SE10 9LS, England

来源：

JOURNAL OF SCHEDULING | 2015年 / 18卷 / 03期

关键词：

Flow shop; Open shop; Minimum makespan;

D O I：

10.1007/s10951-013-0356-7

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper considers scheduling problems on two machines to minimise the makespan. It shows that a simple cyclical search can find a flow shop schedule with one job omitted with makespan less than or equal to the maximum of the total processing time of all jobs on either machine. This flow shop schedule is used as the basis for constructing a number of schedules with minimum makespan for the two machine open shop. The search may be applied unchanged to batches of jobs to provide more optimal schedules.

引用

页码：311 / 314

页数：4

共 5 条

[1] [Anonymous], 1982, DETERMINISTIC STOCHA
[2] de Werra D., 1989, ADV PROJECT SCHEDULI, P171
[3] GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985
[4] Three is easy, two is hard: open shop sum-batch scheduling problem refined
Gribkovskaia, Irina V.
Lee, Chung-Yee
Strusevich, Vitaly A.
de Werra, Dorninique
[J]. OPERATIONS RESEARCH LETTERS, 2006, 34 (04) : 459 - 464
[5] Johnson S. M., 1954, Naval research logistics quarterly, V1, P61, DOI [DOI 10.1002/NAV.3800010110, 10.1002/nav.3800010110]

← 1 →