The transition-point method to meet due-dates and minimize the make-span in the general job-shop sequencing problem∗
暂无分享,去创建一个
[1] Harold H. Greenberg,et al. A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..
[2] Richard D. Smith,et al. A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..
[3] P. Mellor,et al. A Review of Job Shop Scheduling , 1966 .
[4] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[5] Samuel Eilon,et al. A MODIFIED SI RULE IN JOB SHOP SCHEDULING , 1968 .
[6] Jatinder N. D. Gupta,et al. A GENERAL ALGORITHM FOR THE n × M FLOWSHOP SCHEDULING PROBLEM† , 1968 .
[7] William L. Maxwell,et al. Theory of scheduling , 1967 .
[8] R. R. P. Jackson,et al. Elements of production planning and control , 1962 .