Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

被引:51
|
作者
Damodaran, P [1 ]
Srihari, K [1 ]
机构
[1] SUNY Binghamton, Dept Syst Sci & Ind Engn, Binghamton, NY 13902 USA
关键词
batch processing; scheduling; flow shop; mathematical formulation;
D O I
10.1016/j.mcm.2005.01.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Batch processing machines are commonly used in wafer fabrication, kilns, and chambers used for environmental stress screening (ESS). This paper proposes two models to schedule batches of jobs on two machines in a flow shop. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. The jobs are nonidentical in size. The processing time of a batch is the longest processing time of all the jobs in that batch. Mixed integer formulations are proposed for the flow shop problem when the buffer capacity is unlimited or zero. Numerical examples are presented to demonstrate the application of our model. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1465 / 1472
页数:8
相关论文
共 50 条
  • [21] New heuristics for flow shop problem to minimize makespan
    Bai, D.
    Tang, L.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (06) : 1032 - 1040
  • [22] Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms
    Beldar, Pedram
    Battarra, Maria
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2024, 168
  • [23] Minimizing makespan on parallel batch processing machines
    Chang, PY
    Damodaran, P
    Melouk, S
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (19) : 4211 - 4220
  • [24] 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
  • [25] A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times
    Damodaran, Purushothaman
    Velez-Gallego, Mario C.
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (01) : 1451 - 1458
  • [26] Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
    Wang, Xiao-Yuan
    Wang, Ming-Zheng
    Wang, Ji-Bo
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) : 840 - 844
  • [27] Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan
    Wang, Chia-Nan
    Hsu, Hsien-Pin
    Fu, Hsin-Pin
    Nguyen Ky Phuc Phan
    Van Thanh Nguyen
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2022, 40 (01): : 17 - 36
  • [28] Online scheduling on unbounded parallel-batch machines to minimize the makespan
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    INFORMATION PROCESSING LETTERS, 2009, 109 (21-22) : 1211 - 1215
  • [29] An improved heuristic for no-wait flow shop to minimize makespan
    Ye, Honghan
    Li, Wei
    Abedini, Amin
    JOURNAL OF MANUFACTURING SYSTEMS, 2017, 44 : 273 - 279
  • [30] GRASP to minimize makespan for a capacitated batch-processing machine
    Damodaran, Purushothaman
    Ghrayeb, Omar
    Guttikonda, Mallika Chowdary
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 68 (1-4): : 407 - 414