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

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 120卷 / 02期

关键词：

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 条

[81] Note on "parallel machine scheduling with batch setup times" [J].

Webster, S .

OPERATIONS RESEARCH, 1998, 46 (03) :423-423

[82] SCHEDULING GROUPS OF JOBS ON A SINGLE-MACHINE [J].

WEBSTER, S ;

BAKER, KR .

OPERATIONS RESEARCH, 1995, 43 (04) :692-703

[83] The complexity of scheduling job families about a common due date [J].

Webster, ST .

OPERATIONS RESEARCH LETTERS, 1997, 20 (02) :65-74

[84] A new heuristic for a single machine scheduling problem with set-up times [J].

Williams, D ;

Wirth, A .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (01) :175-180

[85]

WOEGINGER GJ, 1997, Y43MAT START

[86]

YANG X, IN PRESS IIE T

[87] ANALYSIS OF APPROXIMATION ALGORITHMS FOR SINGLE-MACHINE SCHEDULING WITH DELIVERY TIMES AND SEQUENCE INDEPENDENT BATCH SETUP TIMES [J].

ZDRZALKA, S .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (02) :371-380

← 1 2 3 4 5 6 7 8 9 →