论文信息 - Four simple heuristics for scheduling a flow-shop

Four simple heuristics for scheduling a flow-shop

This paper concerns the minimization of a complex cost function in a flow-shop. Four heuristic methods for obtaining a good solution to the sum of weighted tardiness and weighted flow-time problem are proposed. Computational results are provided and a, recommendation is made with respect to other objective functions.

L. Gelders | N. Sambandam

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

[2] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[3] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[4] S. S. Panwalkar,et al. Sequencing Research and the Industrial Scheduling Problem , 1973 .

[5] Kenneth Steiglitz,et al. Heuristic-Programming Solution of a Flowshop-Scheduling Problem , 1974, Oper. Res..

[6] L. Gelders,et al. Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[7] Jonathan J. Golovin. Hierarchical integration of planning and control. , 1975 .

[8] Kenneth R. Baker,et al. A Comparative Study of Flow-Shop Algorithms , 1975, Oper. Res..

[9] Ludo Gelders,et al. Comparative evaluation of four solution techniques for solving complex scheduling problems , 1977 .

[10] Ludo Gelders,et al. Coordinating aggregate and detailed scheduling in a flowshop , 1977 .