An extension of Palmer's heuristic for the flow shop scheduling problem
暂无分享,去创建一个
[1] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[2] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[3] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[4] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[5] E. S. Page. An Approach to the Scheduling of Jobs on Machines , 1961 .
[6] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .
[7] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[8] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[9] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .