两阶段混合流程调度问题研究

根据两阶段混合流程调度的特性，对于第一阶段有一台机床，第二阶段有两台并行可替换机床的调度问题，在分枝定界算法和Johnson规则的基础上提出了3种启发式优化调度算法，使得加工时间跨度最小，并根据不同的情况给出了判别算法效率的下边界，对这3种算法的优化效果进行了仿真试验，通过对大量计算结果的分析，分别得出了3种启发式算法的优化效果。

The problem of two-stage hybrid flowshop research

In this paper, we consider the two-stage hybrid flowshop with a single machine at stage 1 and two identical multiple parallel machines at stage 2. To find a minimum makespan schedule, which is NP-complete, three heuristic algorithms based on the branch-and-bound algorithm and Johnson's rule have been proposed in the literature. A lower bound based on solving an artificial hybrid flowshop problem is derived. Furthermore, the computational experiments are conducted to evaluate and compare the effectiveness of these algorithms.