A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
暂无分享,去创建一个
[1] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[2] Said Ashour. Letter to the Editor - An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques , 1970, Oper. Res..
[3] William L. Maxwell,et al. Theory of scheduling , 1967 .
[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] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[7] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .
[8] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[9] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[10] Z. A. Lomnicki. A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .