Scheduling Algorithms

Front Cover
Springer Science & Business Media, Feb 23, 2004 - Business & Economics - 367 pages
1 Review

Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The method used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are updated and summarized. Also the references are updated.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

I
1
II
2
III
3
IV
5
V
6
VI
7
VII
11
VIII
12
XLIX
161
L
174
LII
178
LIII
179
LIV
187
LV
196
LVI
202
LVII
221

IX
13
X
14
XI
18
XII
23
XIII
26
XIV
37
XV
41
XVI
48
XVII
50
XVIII
51
XIX
56
XX
61
XXI
62
XXII
63
XXIII
67
XXIV
73
XXVI
80
XXVII
85
XXIX
86
XXX
89
XXXI
94
XXXII
98
XXXIV
102
XXXV
104
XXXVI
107
XXXIX
124
XL
136
XLI
139
XLIII
145
XLIV
150
XLV
155
XLVI
156
XLVII
158
LVIII
226
LX
227
LXI
232
LXII
241
LXIII
242
LXIV
245
LXV
247
LXVI
253
LXVII
255
LXVIII
257
LXIX
260
LXX
265
LXXII
269
LXXIII
270
LXXIV
275
LXXVI
279
LXXVII
280
LXXVIII
284
LXXIX
288
LXXX
289
LXXXI
290
LXXXII
296
LXXXIV
307
LXXXV
311
LXXXVI
313
LXXXVII
314
LXXXVIII
319
LXXXIX
325
XC
331
XCI
338
XCII
343
XCIII
363
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 356 - JK Lenstra and AHG Rinnooy Kan, Complexity of scheduling under precedence constraints, Working Paper No.
Page 356 - JY-T. Leung and GH Young. Minimizing total tardiness on a single machine with precedence constraints. ORSA Journal on Computing, 2(4):346-352, 1990.

References to this book

All Book Search results »

Bibliographic information