Flow shop vs. permutation shop with time delays

被引：14
|
作者：
Rebaine, D [1 ]
机构：
[1] Univ Quebec, Dept Informat & Math, Chicoutimi, PQ, Canada
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2005年 / 48卷 / 02期
基金：
加拿大自然科学与工程研究理事会;
关键词：
flow shop; permutation schedules; makespan;
D O I：
10.1016/j.cie.2005.01.019
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper considers the evaluation of the worst-case performance ratio between the best solution of the flow shop problem and the permutation flow shop with time delays considerations. It is observed that, even in the restricted case of two machines and unit execution time operations, the two models may generate different optimal values for the makespan. More specifically, it is shown that, in the two-machine case, the performance ratio between the best permutation schedule and the best flow shop schedule is bounded by 2. When the operations of the n jobs are restricted to be unit execution time, this ratio is reduced to (2 - (3/n + 2)) for the two-machine case, and is m for the m-machine case. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：357 / 362
页数：6
相关论文
共 50 条
12345