| 加权完工时间和的调整时间可分离Flow shop排序问题 |
| |
| 引用本文： | 王吉波.加权完工时间和的调整时间可分离Flow shop排序问题[J].数学的实践与认识,2005,35(8):89-93. |
| |
| 作者姓名： | 王吉波 |
| |
| 作者单位： | 沈阳航空工业学院理学系,辽宁,沈阳,110034 |
| |
| 摘 要： | 讨论了2台机器调整时间可分离的FlowShop排序问题,目标函数为极小化加权完工时间和.给出了对于一种特殊情况,问题存在多项式最优算法的充分条件.接着又给出了求解该问题的一个分枝定界法.
|
| 关 键 词： | 排序 Flow Shop 加权完工时间和 调整时间可分离 分枝定界法 |
| 修稿时间： | 2003年1月4日 |
Minimizing Total Weighted Completion Time in a Two-Machine Flow Shop with Sequence-Independent Setup Times |
| |
| WANG Ji-Bo.Minimizing Total Weighted Completion Time in a Two-Machine Flow Shop with Sequence-Independent Setup Times[J].Mathematics in Practice and Theory,2005,35(8):89-93. |
| |
| Authors: | WANG Ji-Bo |
| |
| Abstract: | The two-machine flow shop scheduling problem with set-up times are separated and sequence independent is considered. The objective function is to minimize total weighted completion time. For a special case the sufficient condition is presented in which the problem can be solved by a polynomial algorithm. Moreover, a branch and bound algorithm is given. |
| |
| Keywords: | scheduling flow shop total weighted completion time separate setup time branch and bound algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
