A heuristic algorithm for two-machine re-entrant shop scheduling

被引：27
|
作者：
Drobouchevitch, IG [1 ]
Strusevich, VA [1 ]
机构：
[1] Univ Greenwich, Sch Comp & Math Sci, London SE18 6PF, England
来源：
ANNALS OF OPERATIONS RESEARCH | 1999年 / 86卷 / 0期
关键词：
re-entrant shop scheduling; approximation algorithm; worst-case analysis;
D O I：
10.1023/A:1018927407164
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper considers the problem of sequencing n jobs in a two-machine re-entrant shop with the objective of minimizing the maximum completion time. The shop consists of two machines, M-1 and M-2 , and each job has the processing route (M-1 , M-2 , M-1 ). An O(n log n) time heuristic is presented which generates a schedule with length at most 4/3 times that of an optimal schedule, thereby improving the best previously available worst-case performance ratio of 3/2.
引用
收藏
页码：417 / 439
页数：23
相关论文
共 50 条
12345