Minimising makespan in the two-machine flow-shop with release times

被引：19
|
作者：
Tadei, R
Gupta, JND
Della Croce, F
Cortesi, M
机构：
[1] Politecn Torino, Dipartimento Automat & Informat, I-10129 Turin, Italy
[2] Ball State Univ, Muncie, IN 47306 USA
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1998年 / 49卷 / 01期
关键词：
branch and bound; flow-shop scheduling; release times;
D O I：
10.1057/palgrave.jors.2600481
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper considers the two-machine flow-shop problem with the objective of minimising the makespan subject to different release times. In view of the strongly NP-hard nature of this problem, five lower bounds and two new dominance criteria are proposed together with a decomposition procedure that reduces the problem size by setting jobs at the beginning of the sequence. Several branch and bound procedures are described by applying different lower bounds and branching schemes. A detailed computational campaign has been performed on different kinds of instances testing problems with size up to 200 jobs.
引用
收藏
页码：77 / 85
页数：9
相关论文
共 50 条
  • [41] A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
    Kashyrskikh, KN
    Potts, CN
    Sevastianov, SV
    DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 255 - 271
  • [42] Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
    Hnaien, Faicel
    Arbaoui, Taha
    ANNALS OF OPERATIONS RESEARCH, 2023, 328 (02) : 1437 - 1460
  • [43] Lot splitting to minimize average flow-time in two-machine flow-shop
    Bukchin, J
    Tzur, M
    Jaffe, M
    IIE TRANSACTIONS, 2002, 34 (11) : 953 - 970
  • [44] A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment
    T'kindt, V.
    Della Croce, F.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3244 - 3246
  • [45] A new lower bound for minimising the total completion time in a two-machine flow shop under release dates
    Chalghoumi, Sabrine
    Mrad, Mehdi
    Ladhari, Talel
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [46] An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
    Kalczynski, Pawel J.
    Kamburowski, Jerzy
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2659 - 2665
  • [47] Two-machine flow-shop scheduling to minimize total late work: revisited
    Chen, Xin
    Wang, Zhongyu
    Pesch, Erwin
    Sterna, Malgorzata
    Blazewicz, Jacek
    ENGINEERING OPTIMIZATION, 2019, 51 (07) : 1268 - 1278
  • [48] Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect
    Mesut Cemil İşler
    Bilal Toklu
    Veli Çelik
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 1129 - 1137
  • [49] Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect
    Isler, Mesut Cemil
    Toklu, Bilal
    Celik, Veli
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (9-12): : 1129 - 1137
  • [50] Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop
    Jafari, A. A.
    Zare, H. Khademi
    Lotfi, M. M.
    Tavakkoli-Moghaddam, R.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2016, 29 (06): : 778 - 787
12345