Two-Stage, Hybrid Flowshop Scheduling Problem
暂无分享,去创建一个
This paper describes the two-stage flowshop problem when there are identical multiple machines at each stage, and shows that the problem is NP-complete. An efficient heuristic algorithm is developed for finding an approximate solution of a special case when there is only one machine at stage 2. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated and found to increase with the increase in the number of jobs.
[1] Jatinder N. D. Gupta. Optimal schedules for special structure flowshops , 1975 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[4] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .