A constraint generation approach for two-machine shop problems with jobs selection

被引:7
|
作者
Della Croce, Federico [1 ,2 ]
Koulamas, Christos [3 ]
T'kindt, Vincent [4 ]
机构
[1] Politecn Torino, DAI, Turin, Italy
[2] CNR, IEIIT, Turin, Italy
[3] Florida Int Univ, Coll Business, Miami, FL 33199 USA
[4] Univ Tours, CNRS, LI EA 6300, OC ERL 6305, Tours, France
关键词
Scheduling; Jobs selection; Two-machine shop problems; Constraint generation approach; SCHEDULING PROBLEM; FLOWSHOP;
D O I
10.1016/j.ejor.2016.11.036
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider job selection problems in two-stage flow shops and job shops. The aim is to select the best job subset with a given cardinality to minimize the makespan. These problems are known to be ordinary NP-hard and the current state of the art algorithms can solve flow shop problems with up to 3000 jobs. We introduce a constraint generation approach to the integer linear programming (ILP) formulation of these problems according to which the constraints associated with nearly all potential critical paths are relaxed and then only the ones violated by the relaxed solution are sequentially reinstated. The proposed approach is capable of solving problems with up to 100000 jobs. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:898 / 905
页数:8
相关论文
共 50 条
  • [31] Two-machine flow shop scheduling problems with minimal and maximal delays
    Bouquard J.-L.
    Lenté C.
    4OR, 2006, 4 (1) : 15 - 28
  • [32] Two-Machine Hybrid Flow-Shop Problems in Shared Manufacturing
    Wei, Qi
    Wu, Yong
    CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2022, 131 (02): : 1125 - 1146
  • [33] On two-machine stochastic flow shop
    Wermus, M
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 1390 - 1392
  • [34] A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
    Zhao, Chuanli
    Tang, Hengyong
    OPTIMIZATION LETTERS, 2011, 5 (01) : 183 - 190
  • [35] A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
    Chuanli Zhao
    Hengyong Tang
    Optimization Letters, 2011, 5 : 183 - 190
  • [36] On Two-machine Flow Shop Scheduling
    Chen L.
    Luo W.-C.
    Zhang G.-C.
    Journal of the Operations Research Society of China, 2014, 2 (03) : 333 - 339
  • [37] Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
    Chung, Dae-Young
    Choi, Byung-Cheon
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 226 (01) : 46 - 52
  • [38] Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint
    Xu, Zhijun
    Xu, Dehua
    He, Jie
    Wang, Qi
    Liu, Aihua
    Xiao, Junfang
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2018, 43 (02) : 777 - 788
  • [39] Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint
    Zhijun Xu
    Dehua Xu
    Jie He
    Qi Wang
    Aihua Liu
    Junfang Xiao
    Arabian Journal for Science and Engineering, 2018, 43 : 777 - 788
  • [40] Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan
    Allaoui, H.
    Lamouri, S.
    Artiba, A.
    Aghezzaf, E.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) : 161 - 167