The exact solution proposed to the remaining of COP is a hybrid method combined with dynamic program, bound algorithm and heuristics.

• 最后综合动态规划方法、下界算法和近似方法提出了一种精确求解同顺序加工调度问题的启发式双侧广度优先搜索方法。