论文信息 - Optimal Scheduling in a Multistage Flowshop

Optimal Scheduling in a Multistage Flowshop

Abstract The combinatorial approach to solve the n-job, .M-machine flowshop scheduling problem is examined. The mathematical developments of the Dudek-Teuton algorithm shown are correct and valid if correctly interpreted. However, the optimality conditions developed by these authors are too stringent and as such the combinatorial analysis for the flowshop scheduling problem is extended and an algorithm is proposed for the solution of the multistage flowshop scheduling problem, where the objective is to minimize a specified measure of total production cost and jobs have their associated start and stop lags.

Jatinder N. D. Gupta | J. Gupta

[1] R. A. Dudek,et al. Optimality Criteria for Flowshop Schedules , 1971 .

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

[3] William Karush,et al. Letter to the Editor-A Counterexample to a Proposed Algorithm for Optimal Sequencing of Jobs , 1965 .

[4] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[5] W. Szwarc. Elimination methods in the m × n sequencing problem , 1971 .

[6] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[7] Richard D. Smith,et al. A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..