A new heuristic for the n-job, M-machine flow-shop problem
暂无分享,去创建一个
[1] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[2] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[3] E. S. Page. An Approach to the Scheduling of Jobs on Machines , 1961 .
[4] Jatinder N. D. Gupta,et al. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .
[5] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[6] T. B. Tate,et al. Machine Scheduling Problems , 1978 .
[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] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .
[9] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[10] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[11] Jayant Rajgopal,et al. An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .
[12] Said Ashour. Letter to the Editor - An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques , 1970, Oper. Res..
[13] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[14] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .
[15] G. Rand. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .
[16] William L. Maxwell,et al. Theory of scheduling , 1967 .