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
相关论文
共 17 条
[1]  
AHMADI JH, 1992, OPER RES, V39, P750
[2]   MINIMIZING TOTAL COMPLETION-TIME ON A BATCH PROCESSING MACHINE WITH JOB FAMILIES [J].
CHANDRU, V ;
LEE, CY ;
UZSOY, R .
OPERATIONS RESEARCH LETTERS, 1993, 13 (02) :61-65
[3]   A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size [J].
Danneberg, D ;
Tautenhahn, T ;
Werner, F .
MATHEMATICAL AND COMPUTER MODELLING, 1999, 29 (09) :101-126
[4]  
Ghazvini FJ, 1998, INT J PROD ECON, V55, P273, DOI 10.1016/S0925-5273(98)00067-X
[5]   Scheduling semiconductor burn-in operations to minimize total flowtime [J].
Hochbaum, DS ;
Landy, D .
OPERATIONS RESEARCH, 1997, 45 (06) :874-885
[6]   EFFICIENT SCHEDULING ALGORITHMS FOR A SINGLE BATCH PROCESSING MACHINE [J].
IKURA, Y ;
GIMPLE, M .
OPERATIONS RESEARCH LETTERS, 1986, 5 (02) :61-65
[7]  
KINDT VT, 2003, COMPUTERS OPERATIONS, V30, P505
[8]   Scheduling with agreeable release times and due dates on a batch processing machine [J].
Li, CL ;
Lee, CY .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) :564-569
[9]  
MELOUK S, IN PRESS INT J PRODU
[10]  
Pinedo M., 1995, Scheduling: Theory, Algorithms, and Systems, V2nd