Improved MILP models for two-machine flowshop with batch processing machines

被引：27
|
作者：
Liao, Ching-Jong [1 ]
Liao, Li-Man [2 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
[2] Natl Chin Yi Univ Technol, Dept Ind Engn & Management, Taichung, Taiwan
来源：
MATHEMATICAL AND COMPUTER MODELLING | 2008年 / 48卷 / 7-8期
关键词：
batch processing; scheduling; flow shop; mathematical formulation;
D O I：
10.1016/j.mcm.2008.01.001
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the problem of scheduling jobs in a flowshop with two batch processing machines such that the makespan is minimized. Batch processing machines are frequently encountered in many industrial environments such as heat treatment operations in a steel foundry and chemical processes performed in tanks or kilns. Improved Mixed Integer Linear Programming (MILP) models are presented for the flowshop problem with unlimited or zero intermediate storage. An MILP-based heuristic is also developed for the problem. Computational experiments show that the new MILP models can significantly improve the original ones. Also, the heuristic can obtain the optimal solutions for all the test problem instances. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1254 / 1264
页数：11
相关论文
共 50 条
  • [1] AN EFFECTIVE HEURISTIC FOR TWO-MACHINE FLOWSHOP WITH BATCH PROCESSING MACHINES
    Liao, Li-Man
    Huang, Ching-Jen
    PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 1953 - 1961
  • [2] Tabu search heuristic for two-machine flowshop with batch processing machines
    Liao, Li-Man
    Huang, Ching-Jen
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (03) : 426 - 432
  • [3] A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
    Mosheiov, Gur
    Oron, Daniel
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (03): : 457 - 469
  • [4] A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
    Gur Mosheiov
    Daniel Oron
    4OR, 2023, 21 : 457 - 469
  • [5] A two-machine multi-family flowshop scheduling problem with batch processing
    Yang, DL
    Chern, MS
    Wang, JT
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2001, 8 (04): : 289 - 298
  • [6] Makespan minimization in the two-machine flowshop batch scheduling problem
    Cheng, TCE
    Lin, BMT
    Toker, A
    NAVAL RESEARCH LOGISTICS, 2000, 47 (02) : 128 - 144
  • [7] Makespan minimization in the two-machine flowshop batch scheduling problem
    Cheng, T.C.E.
    Lin, B.M.T.
    Toker, A.
    2000, John Wiley & Sons Inc, New York, NY, United States (47)
  • [8] Scheduling of a two-machine flowshop with travel time between machines
    Panwalkar, S.S.
    Journal of the Operational Research Society, 1991, 42 (07): : 609 - 613
  • [9] An improved two-machine flowshop scheduling with intermediate transportation
    Dong, Jianming
    Wang, Xueshi
    Hu, Jueliang
    Lin, Guohui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (03) : 1316 - 1334
  • [10] An improved two-machine flowshop scheduling with intermediate transportation
    Jianming Dong
    Xueshi Wang
    Jueliang Hu
    Guohui Lin
    Journal of Combinatorial Optimization, 2016, 31 : 1316 - 1334
12345