Minimizing due date related performance measures on two batch processing machines

被引:36
作者
Sung, CS [1 ]
Kim, YH [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Ind Engn, Taejon 305701, South Korea
关键词
batch processing machine; scheduling; flowshop; due date related measures;
D O I
10.1016/S0377-2217(02)00352-1
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper considers a scheduling problem in a two-machine flowshop of two batch processing machines. On each batch processing machine, jobs are processed in a batch, and each batch is allowed to contain jobs up to the maximum capacity of the associated machine. The scheduling problem is analyzed with respect to three due date related objectives including maximum tardiness, number of tardy jobs and total tardiness. In the analysis, several solution properties are characterized and based upon these properties, three efficient polynomial time algorithms are developed for minimizing the due date related measures. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:644 / 656
页数:13
相关论文
共 13 条
[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]   MINIMIZING TOTAL COMPLETION-TIME ON BATCH PROCESSING MACHINES [J].
CHANDRU, V ;
LEE, CY ;
UZSOY, R .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (09) :2097-2121
[4]   DYNAMIC BATCHING HEURISTIC FOR SIMULTANEOUS PROCESSING [J].
GLASSEY, CR ;
WENG, WW .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 1991, 4 (02) :77-82
[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]   EFFICIENT ALGORITHMS FOR SCHEDULING SEMICONDUCTOR BURN-IN OPERATIONS [J].
LEE, CY ;
UZSOY, R ;
MARTINVEGA, LA .
OPERATIONS RESEARCH, 1992, 40 (04) :764-775
[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]   Minimizing total tardiness on a batch processing machine with incompatible job families [J].
Mehta, SV ;
Uzsoy, R .
IIE TRANSACTIONS, 1998, 30 (02) :165-178
[10]   Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed [J].
Sung, CS ;
Yoon, SH .
ENGINEERING OPTIMIZATION, 1997, 28 (03) :231-243