Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds

被引:12
|
作者
Choi, BC
Yoon, SH [1 ]
Chung, SJ
机构
[1] Seoul Natl Univ, Dept Ind Engn, Seoul, South Korea
[2] Soongsil Univ, Dept Ind & Informat Syst Engn, Seoul 156743, South Korea
关键词
proportionate flow shop; NP-complete; machine speed; worst-case performance ratio; weighted shortest processing time;
D O I
10.1080/00207540500268780
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we consider the problem of minimizing the total weighted completion time in an n-job, two-machine proportionate flow shop, where job processing times are inversely proportional to machine speeds. We show that the problem is NP-complete. We provide a tight lower bound to an optimal objective value and show that the worst-case performance ratio of the weighted shortest processing time rule is less than 2. We propose heuristic procedures to find an approximate solution for the problem. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed heuristics.
引用
收藏
页码:715 / 728
页数:14
相关论文
共 50 条