Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint

被引：0
|
作者：
Zhijun Xu
Dehua Xu
Jie He
Qi Wang
Aihua Liu
Junfang Xiao
机构：
[1] Tongji University,School of Mathematical Sciences
[2] East China University of Technology,School of Science
来源：
Arabian Journal for Science and Engineering | 2018年 / 43卷
关键词：
Flow shop; Availability constraint; Makespan; Mixed integer programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A two-machine flow shop scheduling scenario with an availability constraint on one of the two machines is considered. Seven mixed integer programming formulations (MIPFs) are proposed for the problem where the availability constraint is imposed on the first machine. Seven analogs are proposed for its counterpart. Size complexity analysis of these MIPFs is provided. Numerical results indicate that, for either one of the two problems, each of the corresponding first three MIPFs can solve instances of size up to 100 jobs in reasonable times.
引用
收藏
页码：777 / 788
页数：11
相关论文
共 50 条
  • [1] 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
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2018, 43 (02) : 777 - 788
  • [2] Two-machine open shop scheduling with an availability constraint
    Breit, J
    Schmidt, G
    Strusevich, VA
    [J]. OPERATIONS RESEARCH LETTERS, 2001, 29 (02) : 65 - 77
  • [3] An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
    Breit, J
    [J]. INFORMATION PROCESSING LETTERS, 2004, 90 (06) : 273 - 278
  • [4] A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
    Lorigeon, T
    Billaut, JC
    Bouquard, JL
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (11) : 1239 - 1246
  • [5] Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations
    Esmaeilbeigi, Rasul
    Charkhgard, Parisa
    Charkhgard, Hadi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (02) : 419 - 431
  • [6] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hatem Hadda
    Najoua Dridi
    Sonia Hajri-Gabouj
    [J]. 4OR, 2010, 8 : 87 - 99
  • [7] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hadda, Hatem
    Dridi, Najoua
    Hajri-Gabouj, Sonia
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (01): : 87 - 99
  • [8] Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty
    Juvin, Carla
    Houssin, Laurent
    Lopez, Pierre
    [J]. INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2023, 2023, 13884 : 354 - 369
  • [9] On Two-machine Flow Shop Scheduling
    Chen L.
    Luo W.-C.
    Zhang G.-C.
    [J]. Journal of the Operations Research Society of China, 2014, 2 (3) : 333 - 339
  • [10] A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
    Breit, J
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) : 2143 - 2153
12345