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 条
  • [31] Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
    DONG Jianming
    HU Jueliang
    CHEN Yong
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 2013, 28 (03) : 358 - 368
  • [32] Minimizing Makespan Subject to Budget Limitation in Hybrid Flow Shop
    Hojjati, Seyed Mohammad Hossein
    Sahraeyan, Amin
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 18 - +
  • [33] Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm
    Zhou, Shengchao
    Li, Xueping
    Chen, Huaping
    Guo, Cong
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (16) : 4919 - 4937
  • [34] Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop
    Jafari, A. A.
    Zare, H. Khademi
    Lotfi, M. M.
    Tavakkoli-Moghaddam, R.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2016, 29 (06): : 778 - 787
  • [35] A COMBINATORIAL PROPERTY OF PALLET-CONSTRAINED TWO MACHINE FLOW SHOP PROBLEM IN MINIMIZING MAKESPAN
    HOU Sixiang (Institute of Systems Engineering China National Shipbuilding Corporation
    Journal of Systems Science & Complexity, 2002, (04) : 416 - 422
  • [36] A COMBINATORIAL PROPERTY OF PALLET-CONSTRAINED TWO MACHINE FLOW SHOP PROBLEM IN MINIMIZING MAKESPAN
    HOU Sixiang Institute of Systems Engineering China National Shipbuilding Corporation Beijing ChinaHan Hoogeveen Petra SchuurmanEindhoven University of Technology Department of Mathematics and Computer Science POBox MB Eindhoven The Netherlands
    JournalofSystemsScienceandComplexity, 2002, (04) : 416 - 422
  • [37] Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
    Romanova A.A.
    Journal of Applied and Industrial Mathematics, 2015, 9 (04) : 570 - 579
  • [38] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    D. Ravindran
    S.J. Selvakumar
    R. Sivaraman
    A. Noorul Haq
    The International Journal of Advanced Manufacturing Technology, 2005, 25 : 1007 - 1012
  • [39] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
    Ravindran, D
    Haq, AN
    Selvakuar, SJ
    Sivaraman, R
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (9-10): : 1007 - 1012
  • [40] Minimizing makespan for mixed batch scheduling with identical machines and unequal ready times
    JinDian Huang
    Scientific Reports, 15 (1)
12345