Minimizing Makespan in a Flow Shop with Two Batch Machines

被引：0
|
作者：
Huang, Jin-dian [1 ,2 ]
Liu, Jian-jun [1 ]
Chen, Qing-xin [1 ]
Mao, Ning [1 ]
机构：
[1] Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
[2] Jieyang Vocat & Tech Coll, Dept Mech & Elect Engn, Jieyang, Peoples R China
来源：
PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT: CORE THEORY AND APPLICATIONS OF INDUSTRIAL ENGINEERING (VOL 1) | 2016年
关键词：
Batch processing; Flow shop; Heat-treatment; Mathematical formulation; PROCESSING MACHINES; 2-MACHINE FLOWSHOP; TRANSPORTATION; ALGORITHM; JOBS;
D O I：
10.2991/978-94-6239-180-2_28
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
On the background of the heat-treatment operation in the mould manufacturers, a flow shop scheduling problem is described to minimize makespan with two batch machines. The jobs differ from each other in weights and due-dates. An improved mixed integer linear programming (MILP) model is developed. A heuristic is proposed to improve the computing efficiency of the improved MILP model. A small-size instance is conducted to validate the optimal solution can be obtained by the improved MILP model. Large-size instances are designed to demonstrate the computing efficiency of the improved MILP model and the heuristic.
引用
收藏
页码：283 / 292
页数：10
相关论文
共 50 条
  • [41] A note on "minimizing makespan in three machine flow shop with deteriorating jobs"
    Jafari, Abbas-Ali
    Khademi-Zare, Hassan
    Lotfi, M. M.
    Tavakkoli-Moghaddam, Reza
    COMPUTERS & OPERATIONS RESEARCH, 2016, 72 : 93 - 96
  • [42] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Dipak Laha
    Uday K. Chakraborty
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 97 - 109
  • [43] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2): : 97 - 109
  • [44] Minimizing the makespan on two identical parallel machines with mold constraints
    Chung, Tsuiping
    Gupta, Jatinder N. D.
    Zhao, Haidan
    Werner, Frank
    COMPUTERS & OPERATIONS RESEARCH, 2019, 105 : 141 - 155
  • [45] Minimizing Makespan in Flow Shop under No-wait Restriction on Jobs
    Nailwal, Kewal Krishan
    Gupta, Deepak
    Sharma, Sameer
    2016 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, AND OPTIMIZATION TECHNIQUES (ICEEOT), 2016, : 1555 - 1559
  • [46] Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
    Cheng, Bayi
    Yang, Shanlin
    Ma, Ying
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2012, 43 (12) : 2185 - 2192
  • [47] A genetic algorithm for Makespan minimization in a no-wait flow shop problem with two batching machines
    Jolai, F.
    Kor, H.
    Hatefi, S. M.
    Iranmanesh, H.
    2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY, VOL II, PROCEEDINGS, 2009, : 238 - 242
  • [48] Minimizing makespan in a two-stage system with flowshop and open shop
    Su, LH
    Chou, FD
    Ting, WC
    COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 49 (04) : 520 - 536
  • [49] Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
    Espinouse, ML
    Formanowicz, P
    Penz, B
    COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) : 497 - 500
  • [50] Flow shop scheduling with two batch processing machines and nonidentical job sizes
    H. S. Mirsanei
    B. Karimi
    F. Jolai
    The International Journal of Advanced Manufacturing Technology, 2009, 45 : 553 - 572
12345