Two-Stage, Hybrid Flowshop Scheduling Problem
研究每阶段有多台相同机器的两阶段流水车间调度问题，证明其为NP完全，并针对第二阶段只有一台机器的特例提出高效启发式算法，实验表明算法效果随工件数增加而提升。
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.