| n个零件在m台机器上加工有停歇时间的计划排序问题 |
| |
| 作者单位： | Gao Yanqun Cai Zelin( Department of Mathematics，( Department of Mathematics，Central China Normal University ) Hubei Normal University ) |
| |
| 摘 要： | 本文就n个零件在m台机器上加工且在每两台机器加工时段之间存在停歇时段,以总加工时间最小为目标的排序问题当零件加工同顺序时进行讨论,给出了m=3时的分支——定界算法,是文1]方法的推广。
|
| 关 键 词： | 停歇时间 可行和加工时间 分支——定界算法 |
A SEQUENCING PROBLEM THAT N SPARES ARE PROCESSED ON M MACHINES |
| |
| Authors: | Gao Yanqun Cai Zelin |
| |
| Abstract: | 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. |
| |
| Keywords: | Interval time Available sum Operative time Branch and Bound Method |
| 本文献已被 CNKI 等数据库收录！ |
