论文信息 - ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER

ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER

A new flowshop scheduling problem related to automated manufacturing systelIls such as FMS's and FMC's is discussed. The problem is shown to be an extension of the two-machine f10wship problem addressed by Johnson (or a special case of the three machine flows hop problem), and to be NP-hard. Some solvable cases are discussed.

Hiroshi Kise | H. Kise

[1] T. Arthanari,et al. A note on a paper by W. Szwarc , 1971 .

[2] Toshihide Ibaraki,et al. Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .

[3] Fennell Burns,et al. A special case of the 3 × n flow shop problem , 1975 .

[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[6] R. Jaikumar. Postindustrial manufacturing , 1986 .

[7] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.

[8] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[9] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .