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 条
  • [1] A heuristic algorithm for two‐machine re‐entrant shop scheduling
    I.G. Drobouchevitch
    V.A. Strusevich
    Annals of Operations Research, 1999, 86 : 417 - 439
  • [2] Heuristic algorithms for two-machine re-entrant flowshop scheduling problem with jobs of two classes
    Jeong, BongJoo
    Shim, Sang-Oh
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2017, 11 (05):
  • [3] Heuristic algorithms for two machine re-entrant flow shop
    Jing, Caixia
    Tang, Guochun
    Qian, Xingsan
    THEORETICAL COMPUTER SCIENCE, 2008, 400 (1-3) : 137 - 143
  • [4] Minimizing makespan on a two-machine re-entrant flowshop
    Choi, S-W
    Kim, Y-D
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (07) : 972 - 981
  • [5] Minimizing total tardiness on a two-machine re-entrant flowshop
    Choi, Seong-Woo
    Kim, Yeong-Dae
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (02) : 375 - 384
  • [6] A Heuristic for Variable Re-Entrant Scheduling Problems
    van der Tempel, Roel
    van Pinxten, Joost
    Geilen, Marc
    Waqas, Umar
    2018 21ST EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2018), 2018, : 336 - 341
  • [7] Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines
    Kim, H-W
    Lee, D-H
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2009, 223 (04) : 433 - 442
  • [8] A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints
    Zhang, Xiang Yi
    Chen, Lu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (16) : 5293 - 5305
  • [9] A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
    Chen, Jen-Shiang
    Pan, Jason Chao-Hsien
    Lin, Chien-Min
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (01) : 570 - 577
  • [10] A model for a Special Re-entrant Flow Shop Scheduling
    Cai, Yue
    Wang, Jian
    Li, Hua
    2010 INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONIC AND COMPUTER SCIENCE, VOLS 1-3, 2010, : 1887 - 1891
12345