| 折扣加权总完工时间的调整时间可分离无等待Flow Shop排序问题 |
| |
| 引用本文： | 王吉波,夏尊铨. 折扣加权总完工时间的调整时间可分离无等待Flow Shop排序问题[J]. 系统工程, 2003, 21(3): 91-94 |
| |
| 作者姓名： | 王吉波 夏尊铨 |
| |
| 作者单位： | 大连理工大学应用数学系,辽宁,大连,116024 |
| |
| 摘 要： | 研究3台机器调整时间可分离的无等待F1ow Shop排序问题，目标函数为极小化折扣加权总完工时间。对某些特殊情况，给出问题存在多项式最优算法的充分条件。在此条件下得到求解调整时间可分离的无等待F1ow Shop排序问题的分派规则。
|
| 关 键 词： | F1owShop排序问题 目标函数 调整时间 折扣加权总完工时间 多项式最优算法 |
| 文章编号： | 1001-4098(2003)03-0091-04 |
Discounted Total Weighted Completion Time in No-Wait Flow Shop with Separated Setup Times |
| |
| WANG Ji-bo,XIA Zun-quan. Discounted Total Weighted Completion Time in No-Wait Flow Shop with Separated Setup Times[J]. Systems Engineering, 2003, 21(3): 91-94 |
| |
| Authors: | WANG Ji-bo XIA Zun-quan |
| |
| Abstract: | Discounted total weighted completion time in three-machine no-wait flow shop scheduling problem with separated setup times was studied. For some special cases the sufficient condition is presented in which the problem can be solved by polynomial algorithm. Under this condition, the no-wait flow shop scheduling problem can get the dispatching rules. |
| |
| Keywords: | Flow Shop Scheduling Discounted Total Weighted Completion Time Set-up Time No-Wait Optimal Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
