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 条
  • [31] Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
    Cheng, Bayi
    Yang, Shanlin
    Hu, Xiaoxuan
    Li, Kai
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (03) : 571 - 578
  • [32] An efficient method for no-wait flow shop scheduling to minimize makespan
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2, 2006, : 1296 - 1301
  • [33] Two-stage proportionate flexible flow shop to minimize the makespan
    Choi, Byung-Cheon
    Lee, Kangbok
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 123 - 134
  • [34] Two-stage proportionate flexible flow shop to minimize the makespan
    Byung-Cheon Choi
    Kangbok Lee
    Journal of Combinatorial Optimization, 2013, 25 : 123 - 134
  • [35] Makespan minimization in flowshop batch processing problem with different batch compositions on machines
    Main, Hossein N. Z.
    Salmasi, Nasser
    Shahvari, Omid
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2017, 193 : 832 - 844
  • [36] Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines
    Sun, Lin-Hui
    Sun, Lin-Yan
    Wang, Ming-Zheng
    Wang, Ji-Bo
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 138 (01) : 195 - 200
  • [37] A GRASP approach for makespan minimization on parallel batch processing machines
    Damodaran, Purushothaman
    Velez-Gallego, Mario C.
    Maya, Jairo
    JOURNAL OF INTELLIGENT MANUFACTURING, 2011, 22 (05) : 767 - 777
  • [38] A GRASP approach for makespan minimization on parallel batch processing machines
    Purushothaman Damodaran
    Mario C. Vélez-Gallego
    Jairo Maya
    Journal of Intelligent Manufacturing, 2011, 22 : 767 - 777
  • [39] On-line algorithms for minimizing makespan on batch processing machines
    Zhang, GC
    Cai, XQ
    Wong, CK
    NAVAL RESEARCH LOGISTICS, 2001, 48 (03) : 241 - 258
  • [40] Exact distribution of the makespan in a two machines flow shop with two kinds of jobs
    Baptiste, P
    Jacquemard, C
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 74 (1-3) : 77 - 83