Two-stage Flowshop Scheduling Problem with Bicriteria
研究两阶段流水车间调度问题，目标是在获得最优完工时间的前提下最小化总流程时间，开发了分支定界和两种启发式算法，并实验验证其有效性。
AbstractThe two-stage flowshop scheduling problem with the objective of minimizing total flowtime subject to obtaining the optimal makespan is discussed. A branch-and-bound algorithm and two heuristic algorithms have been developed. The results of the experimental investigation of the effectiveness of the algorithms are also presented.Keywords: Branch-and-BoundFlowshopHeuristicsScheduling