n个零件在m台机器上加工有停歇时间的计划排序问题

A SEQUENCING PROBLEM THAT N SPARES ARE PROCESSED ON M MACHINES

本文就n个零件在m台机器上加工且在每两台机器加工时段之间存在停歇时段,以总加工时间最小为目标的排序问题当零件加工同顺序时进行讨论,给出了m=3时的分支——定界算法,是文[1]方法的推广。

In this paper we discussed the sequencing problem that n spares are processed with the same order on m machines. Introduced the Branch and Bound Method to find out the optimal solution of the sequencing problem for 3 machines.