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
关键词
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 条
  • [1] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Manjeshwar, Praveen Kumar
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 55 (9-12): : 1171 - 1182
  • [2] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Praveen Kumar Manjeshwar
    Purushothaman Damodaran
    Krishnaswami Srihari
    The International Journal of Advanced Manufacturing Technology, 2011, 55 : 1171 - 1182
  • [3] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Shanthi Muthuswamy
    Mario C. Vélez-Gallego
    Jairo Maya
    Miguel Rojas-Santiago
    The International Journal of Advanced Manufacturing Technology, 2012, 63 : 281 - 290
  • [4] Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing
    Manjeshwar, Praveen Kumar
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2009, 25 (03) : 667 - 679
  • [5] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Muthuswamy, Shanthi
    Velez-Gallego, Mario C.
    Maya, Jairo
    Rojas-Santiago, Miguel
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 63 (1-4): : 281 - 290
  • [6] Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs
    Huang, J. D.
    Liu, J. J.
    Chen, Q. X.
    Mao, N.
    ENGINEERING OPTIMIZATION, 2017, 49 (06) : 1010 - 1023
  • [7] An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines
    Ali Husseinzadeh Kashan
    Behrooz Karimi
    The International Journal of Advanced Manufacturing Technology, 2009, 40 : 582 - 594
  • [8] An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines
    Kashan, Ali Husseinzadeh
    Karimi, Behrooz
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (5-6): : 582 - 594
  • [9] Minimising makespan in a no-wait flow shop with two batch processing machines: A grasp algorithm
    Maya, Jairo
    Muthuswamy, Shanthi
    Vélez-Gallego, Mario C.
    Rojas-Santiago, Miguel
    International Journal of Industrial and Systems Engineering, 2014, 17 (02) : 152 - 169
  • [10] Minimizing makespan on parallel machines with batch arrivals
    Chung, Tsui-Ping
    Liao, Ching-Jong
    Lin, Chien-Hung
    ENGINEERING OPTIMIZATION, 2012, 44 (04) : 467 - 476