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 条
  • [31] BOTTLENECK ADJACENT MATCHING 1 (BAM1) HEURISTIC FOR RE-ENTRANT FLOW SHOP WITH DOMINANT MACHINE
    Bareduan, Salleh Ahmad
    Hasan, Sulaiman Hj
    PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 26 - 34
  • [32] Bottleneck Adjacent Matching 4 (BAM4) Heuristic For Re-Entrant Flow Shop With Dominant Machine
    Bareduan, S. A.
    Hasan, S. H.
    IEEM: 2008 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-3, 2008, : 148 - 152
  • [33] Bottleneck Adjacent Matching 3 (BAM3) Heuristic For Re-Entrant Flow Shop With Dominant Machine
    Bareduan, S. A.
    Hasan, S. H.
    IEEM: 2008 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-3, 2008, : 143 - 147
  • [34] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Lee, Carman K. M.
    Lin, Danping
    Ho, William
    Wu, Zhang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (9-12): : 1105 - 1113
  • [35] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Carman K. M. Lee
    Danping Lin
    William Ho
    Zhang Wu
    The International Journal of Advanced Manufacturing Technology, 2011, 56 : 1105 - 1113
  • [36] A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem
    Geng, Kaifeng
    Ye, Chunming
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (02) : 3951 - 3971
  • [37] Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
    Jeong, BongJoo
    Kim, Yeong-Dae
    COMPUTERS & OPERATIONS RESEARCH, 2014, 47 : 72 - 80
  • [38] An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
    Breit, J
    INFORMATION PROCESSING LETTERS, 2004, 90 (06) : 273 - 278
  • [39] Minimizing total completion time for re-entrant flow shop scheduling problems
    Jing, Caixia
    Huang, Wanzhen
    Tang, Guochun
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (48) : 6712 - 6719
  • [40] Modelling and Simulation of Re-Entrant Flow Shop Scheduling: An Application in Semiconductor Manufacturing
    El-Khouly, Ingy A.
    El-Kilany, Khaled S.
    El-Sayed, Aziz E.
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 211 - 216
12345