| 极小化加权完工时间和的Flowshop问题的算法 |
| |
| 引用本文： | 赵传立,张庆灵,唐恒永.极小化加权完工时间和的Flowshop问题的算法[J].运筹学学报,2002,6(4):50-56. |
| |
| 作者姓名： | 赵传立 张庆灵 唐恒永 |
| |
| 作者单位： | 1. 东北大学理学院,沈阳,110006
2. 沈阳师范大学数学系,沈阳,110034 |
| |
| 摘 要： | 本文讨论了极小化加权完工时间和的Flowshop问题.我们给出了一个最坏情况误差界为m的启发式算法,对于m=2的情况,如果工件具有一致权因子,即pi
|
| 关 键 词： | 极小化加权完工时间 Flowshop问题 算法 排序 |
A Flowshop Scheduling Algorithm to Minimize Total Weighted Completion Time |
| |
| CHUANLI ZHAO QINGLING ZHANG.A Flowshop Scheduling Algorithm to Minimize Total Weighted Completion Time[J].OR Transactions,2002,6(4):50-56. |
| |
| Authors: | CHUANLI ZHAO QINGLING ZHANG |
| |
| Abstract: | We consider the problem of minimizing total weighted completion time in flowshop.We present a heuristic algorithm with worst-case bound m. For m = 2, if jobs have agreeable weights i.e.where pi＜pj implies wi≥wj,(i,j=1,2,…,n).The worst-case bound is 2β/α+β where α and β denote the minimum and maximum processing time ofall operations. Furthermore, we analyze two special cases for m = 2, and polynomialalgorithms are given. |
| |
| Keywords: | Scheduling Flow shop Total weighted completion time Worst-case bound |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
