Scheduling with batching: A review

被引:676
作者
Potts, CN [1 ]
Kovalyov, MY
机构
[1] Univ Southampton, Fac Math Studies, Southampton S017 1BJ, Hants, England
[2] Natl Acac Sci Belarus, Inst Engn Cybernet, Minsk 220012, BELARUS
关键词
scheduling; batching; families; review; complexity; algorithm; dynamic programming; approximation;
D O I
10.1016/S0377-2217(99)00153-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine call process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:228 / 249
页数:22
相关论文
共 87 条
[1]   BATCHING AND SCHEDULING JOBS ON BATCH AND DISCRETE PROCESSORS [J].
AHMADI, JH ;
AHMADI, RH ;
DASU, S ;
TANG, CS .
OPERATIONS RESEARCH, 1992, 40 (04) :750-763
[2]   SINGLE FACILITY MULTICLASS JOB SCHEDULING [J].
AHN, BH ;
HYUN, JH .
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) :265-272
[3]   THE COMPLEXITY OF ONE-MACHINE BATCHING PROBLEMS [J].
ALBERS, S ;
BRUCKER, P .
DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) :87-107
[4]  
[Anonymous], 1955, 43 U CAL MAN SCI RES
[5]   SCHEDULING THE PRODUCTION OF COMPONENTS AT A COMMON FACILITY [J].
BAKER, KR .
IIE TRANSACTIONS, 1988, 20 (01) :32-35
[6]  
BAKI MF, 1997, 205MS U WAT DEP MAN
[7]  
Brucker P., 1998, Journal of Scheduling, V1, P31, DOI 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO
[8]  
2-R
[9]   Batch scheduling with deadlines on parallel machines [J].
Brucker, P ;
Kovalyov, MY ;
Shafransky, YM ;
Werner, F .
ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) :23-40
[10]  
BRUCKER P, 1996, MATH METHOD OPER RES, V43, P1