论文信息 - Heuristics for flow-shop scheduling

Heuristics for flow-shop scheduling

Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data. New heuristic scheduling rules are determined which give high performance for flow-shop scheduling where there is (i) no job-passing and (ii) no job-waiting.

A. S. Spachis | J. R. King | J. King | A. Spachis

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

[2] E. S. Page. An Approach to the Scheduling of Jobs on Machines , 1961 .

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

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

[5] Z. A. Lomnicki,et al. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

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

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

[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[9] D. A. Wismer,et al. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[10] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .

[11] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[12] N. A. J. Hastings,et al. A New Bound for Machine Scheduling , 1976 .

[13] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[14] Jr King. Scheduling and the problem of computational complexity , 1979 .