论文信息 - An Evaluation of Flow Shop Sequencing Heuristics

An Evaluation of Flow Shop Sequencing Heuristics

This paper presents computational experience with eleven flow shop sequencing heuristics. Included in the study are three previously unreported heuristics, one of which turns out to be superior to the other ten heuristics tested. The comparisons were made on a variety of problem sizes, up to fifty jobs and fifty operations.

David G. Dannenbring | D. Dannenbring

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

[2] William L. Maxwell,et al. Theory of scheduling , 1967 .

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

[4] Z. A. Lomnicki. A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[5] T. A. J. Nicholson,et al. A permutation procedure for job-shop scheduling , 1968, Comput. J..

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

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

[8] Said Ashour. Letter to the Editor - An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques , 1970, Oper. Res..

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

[10] G. B. McMahon,et al. Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..