|
|
1 | (8) |
|
|
6 | (3) |
|
|
9 | (48) |
|
|
9 | (2) |
|
Problems, Algorithms, Complexity |
|
|
11 | (10) |
|
Problems and Their Encoding |
|
|
11 | (2) |
|
|
13 | (3) |
|
|
16 | (5) |
|
|
21 | (11) |
|
|
21 | (1) |
|
Special Classes of Digraphs |
|
|
22 | (3) |
|
|
25 | (7) |
|
|
32 | (3) |
|
|
32 | (1) |
|
|
33 | (2) |
|
Heuristic and Approximation Algorithms |
|
|
35 | (22) |
|
|
35 | (2) |
|
|
37 | (14) |
|
|
51 | (6) |
|
Definition, Analysis and Classification of Scheduling Problems |
|
|
57 | (16) |
|
Definition of Scheduling Problems |
|
|
57 | (5) |
|
Analysis of Scheduling Problems and Algorithms |
|
|
62 | (3) |
|
Motivations for Deterministic Scheduling Problems |
|
|
65 | (3) |
|
Classification of Deterministic Scheduling Problems |
|
|
68 | (5) |
|
|
71 | (2) |
|
Scheduling on One Processor |
|
|
73 | (64) |
|
Minimizing Schedule Length |
|
|
73 | (10) |
|
Scheduling with Release Times and Deadlines |
|
|
74 | (7) |
|
Scheduling with Release Times and Delivery Times |
|
|
81 | (2) |
|
Minimizing Mean Weighted Flow Time |
|
|
83 | (12) |
|
Minimizing Due Date Involving Criteria |
|
|
95 | (18) |
|
|
95 | (9) |
|
|
104 | (5) |
|
|
109 | (3) |
|
|
112 | (1) |
|
Minimizing Change-Over Cost |
|
|
113 | (8) |
|
|
113 | (3) |
|
|
116 | (5) |
|
|
121 | (16) |
|
|
121 | (5) |
|
|
126 | (3) |
|
|
129 | (8) |
|
Scheduling on Parallel Processors |
|
|
137 | (68) |
|
Minimizing Schedule Length |
|
|
137 | (29) |
|
|
137 | (20) |
|
Uniform and Unrelated Processors |
|
|
157 | (9) |
|
Minimizing Mean Flow Time |
|
|
166 | (5) |
|
|
166 | (2) |
|
Uniform and Unrelated Processors |
|
|
168 | (3) |
|
Minimizing Due Date Involving Criteria |
|
|
171 | (9) |
|
|
171 | (7) |
|
Uniform and Unrelated Processors |
|
|
178 | (2) |
|
|
180 | (25) |
|
Semi-Identical Processors |
|
|
181 | (8) |
|
Scheduling Imprecise Computations |
|
|
189 | (3) |
|
|
192 | (4) |
|
|
196 | (9) |
|
Communication Delays and Multiprocessor Tasks |
|
|
205 | (42) |
|
|
205 | (5) |
|
Scheduling Multiprocessor Tasks |
|
|
210 | (16) |
|
|
210 | (8) |
|
|
218 | (6) |
|
|
224 | (2) |
|
Scheduling Uniprocessor Tasks with Communication Delays |
|
|
226 | (7) |
|
Scheduling without Task Duplication |
|
|
228 | (2) |
|
Scheduling with Task Duplication |
|
|
230 | (1) |
|
Scheduling in Processor Networks |
|
|
231 | (2) |
|
Scheduling Divisible Tasks |
|
|
233 | (14) |
|
|
240 | (7) |
|
Scheduling in Flow and Open Shops |
|
|
247 | (26) |
|
|
247 | (3) |
|
The Flow Shop Scheduling Problem |
|
|
247 | (2) |
|
|
249 | (1) |
|
|
250 | (9) |
|
The algorithms of Johnson and Akers |
|
|
250 | (3) |
|
Dominance and Branching Rules |
|
|
253 | (1) |
|
|
254 | (5) |
|
|
259 | (8) |
|
Priority Rule and Local Search Based Heuristics |
|
|
259 | (3) |
|
|
262 | (4) |
|
|
266 | (1) |
|
|
267 | (6) |
|
|
269 | (4) |
|
|
273 | (44) |
|
|
273 | (7) |
|
|
273 | (1) |
|
|
273 | (3) |
|
|
276 | (1) |
|
|
277 | (3) |
|
|
280 | (8) |
|
|
280 | (1) |
|
|
281 | (1) |
|
|
282 | (4) |
|
|
286 | (2) |
|
|
288 | (20) |
|
|
288 | (5) |
|
|
293 | (1) |
|
|
294 | (14) |
|
|
308 | (9) |
|
|
308 | (9) |
|
Scheduling under Resource Constraints |
|
|
317 | (50) |
|
|
317 | (11) |
|
Scheduling Multiprocessor Tasks |
|
|
328 | (14) |
|
Scheduling with Continuous Resources |
|
|
342 | (25) |
|
|
342 | (2) |
|
Processing Speed vs. Resource Amount Model |
|
|
344 | (9) |
|
Processing Time vs. Resource Amount Model |
|
|
353 | (5) |
|
Ready Time vs. Resource Amount Model |
|
|
358 | (4) |
|
|
362 | (5) |
|
Scheduling in Flexible Manufacturing Systems |
|
|
367 | (54) |
|
|
367 | (3) |
|
Scheduling Flexible Flow Shops |
|
|
370 | (9) |
|
|
370 | (1) |
|
Heuristics and their Performance |
|
|
371 | (2) |
|
Branch and Bound Algorithm |
|
|
373 | (6) |
|
Scheduling Dynamic Job Shops |
|
|
379 | (8) |
|
|
379 | (1) |
|
Heuristic Algorithm for the Static Problem |
|
|
380 | (6) |
|
Computational Experiments |
|
|
386 | (1) |
|
Simultaneous Scheduling and Routing in some FMS |
|
|
387 | (9) |
|
|
387 | (2) |
|
Vehicle Scheduling for a Fixed Production Schedule |
|
|
389 | (5) |
|
Simultaneous Job and Vehicle Scheduling |
|
|
394 | (2) |
|
Batch Scheduling in Flexible Flow Shops under Resource Constraints |
|
|
396 | (25) |
|
Introduction - Statement of the Problem |
|
|
396 | (2) |
|
|
398 | (9) |
|
Heuristic Solution Approach |
|
|
407 | (7) |
|
Implementation and Computational Experiment |
|
|
414 | (1) |
|
|
415 | (6) |
|
Computer Integrated Production Scheduling |
|
|
421 | (48) |
|
Scheduling in Computer Integrated Manufacturing |
|
|
422 | (5) |
|
A Reference Model for Production Scheduling |
|
|
427 | (8) |
|
IPS: An Intelligent Production Scheduling System |
|
|
435 | (34) |
|
|
442 | (14) |
|
Knowledge-based Scheduling |
|
|
456 | (6) |
|
Integrated Problem Solving |
|
|
462 | (4) |
|
|
466 | (3) |
Index |
|
469 | |