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 条
  • [21] New results on two-machine flow-shop scheduling with rejection
    Zhang, Liqi
    Lu, Lingfa
    Li, Shisheng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1493 - 1504
  • [22] Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints
    Kejia Chen
    Debiao Li
    Xiao Wang
    Journal of Systems Science and Systems Engineering, 2020, 29 : 400 - 411
  • [23] Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints
    Chen, Kejia
    Li, Debiao
    Wang, Xiao
    JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2020, 29 (04) : 400 - 411
  • [24] A Robust Two-Machine Flow-Shop Scheduling Model with Scenario-Dependent Processing Times
    Hsu, Chia-Lun
    Lin, Win-Chin
    Duan, Lini
    Liao, Jan-Ray
    Wu, Chin-Chia
    Chen, Juin-Han
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2020, 2020
  • [25] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Wang, Ji-Bo
    Ji, P.
    Cheng, T. C. E.
    Wang, Dan
    OPTIMIZATION LETTERS, 2012, 6 (07) : 1393 - 1409
  • [26] Scheduling With Uncertain Processsing Times: Applying β-Robust Schedule On Two-Machine Flow-Shop With Constraints
    Ullah, Saif
    Liu, Qiong
    Zhang, Chaoyong
    Awan, Yasser Riaz
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1946 - 1950
  • [27] Two-machine flow shop scheduling with two criteria:: Maximum earliness and makespan
    Toktas, B
    Azizoglu, M
    Köksalan, SK
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (02) : 286 - 295
  • [28] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Ji-Bo Wang
    P. Ji
    T. C. E. Cheng
    Dan Wang
    Optimization Letters, 2012, 6 : 1393 - 1409
  • [29] A two-machine flow-shop scheduling with a deteriorating maintenance activity on the second machine
    Gara-Ali, Ahmed
    Espinouse, Marie-Laure
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 481 - 488
  • [30] Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
    Cai, Yinhui
    Chen, Guangting
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Liu, Longcheng
    Zhang, An
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 205 - 217
12345