ISBN: 3540419314
TITLE: Scheduling Computer and Manufacturing Proceses
AUTHOR: Blazewicz et al.
TOC:

Contents
1 Introduction 1
References 6
2 Basics 9
2.1 Sets and Relations 9
2.2 Problems, Algorithms, Complexity 11
2.2.1 Problems and Their Encoding 11
2.2.2 Algorithms 13
2.2.3 Complexity 16
2.3 Graphs and Networks 21
2.3.1 Basic Notions 21
2.3.2 Special Classes of Digraphs 22
2.3.3 Networks 25
2.4 Enumerative Methods 32
2.4.1 Dynamic Programming 32
2.4.2 Branch and Bound 33

2.5 Heuristic and Approximation Algorithms 35
2.5.1 Approximation Algorithms 35
2.5.2 Local Search Heuristics 37
References 51
3 Definition, Analysis and Classification of Scheduling Problems 57
3.1 Definition of Scheduling Problems 57
3.2 Analysis of Scheduling Problems and Algorithms 62
3.3 Motivations for Deterministic Scheduling Problems 65
3.4 Classification of Deterministic Scheduling Problems 68
References 71
4 Scheduling on One Processor 73
4.1 Minimizing Schedule Length 73
4.1.1 Scheduling with Release Times and Deadlines 74
4.1.2 Scheduling with Release Times and Delivery Times 81
4.2 Minimizing Mean Weighted Flow Time 83
4.3 Minimizing Due Date Involving Criteria 95
4.3.1 Maximum Lateness 95
4.3.2 Number of Tardy Tasks 104
4.3.3 Mean Tardiness 109
4.3.4 Mean Earliness 112
4.4 Minimizing Change-Over Cost 113
4.4.1 Setup Scheduling 113
4.4.2 Lot Size Scheduling 116
4.5 Other Criteria 121
4.5.1 Maximum Cost 121
4.5.2 Total Cost 126
References 129
5 Scheduling on Parallel Processors 137
5.1 Minimizing Schedule Length 137
5.1.1 Identical Processors 137
5.1.2 Uniform and Unrelated Processors 157
5.2 Minimizing Mean Flow Time 166
5.2.1 Identical Processors 166
5.2.2 Uniform and Unrelated Processors 168
5.3 Minimizing Due Date Involving Criteria 171
5.3.1 Identical Processors 171
5.3.2 Uniform and Unrelated Processors 178
5.4 Other Models 180
5.4.1 Semi-Identical Processors 181
5.4.2 Scheduling Imprecise Computations 189
5.4.3 Lot Size Scheduling 192
References 196
6 Communication Delays and Multiprocessor Tasks 205
6.1 Introductory Remarks 205
6.2 Scheduling Multiprocessor Tasks 210
6.2.1 Parallel Processors 210
6.2.2 Dedicated Processors 218
6.2.3 Refinment scheduling 224
6.3 Scheduling Uniprocessor Tasks with Communication Delays 226
6.3.1 Scheduling without Task Duplication 228
6.3.2 Scheduling with Task Duplication 230
6.3.3 Scheduling in Processor Networks 231
6.4 Scheduling Divisible Tasks 233
References 240
7 Scheduling in Flow and Open Shops 247
7.1 Introduction 247
7.1.1 The Flow Shop Scheduling Problem 247
7.1.2 Complexity 249
7.2 Exact Methods 250
7.2.1 The algorithms of Johnson and Akers 250
7.2.2 Dominance and Branching Rules 253
7.2.3 Lower Bounds 254
7.3 Approximation Algorithms 259
7.3.1 Priority Rule and Local Search Based Heuristics 259
7.3.2 Worst-Case Analysis 262
7.3.3 No Wait in Process 266
7.4 Open Shop Scheduling 267
References 269
8 Scheduling in Job Shops 273
8.1 Introduction 273
8.1.1 The Problem 273
8.1.2 Modelling 273
8.1.3 Complexity 276
8.1.4 The History 277
8.2 Exact Methods 280
8.2.1 Branch and Bound 280
8.2.2 Lower Bounds 281
8.2.3 Branching 282
8.2.4 Valid Inequalities 286
8.3 Approximation Algorithms 288
8.3.1 Priority Rules 288
8.3.3 Opportunistic Scheduling 293
8.3.4 Local Search 294
8.4 Conclusions 308
References 308
9 Scheduling under Resource Constraints 317
9.1 Classical Model 317
9.2 Scheduling Multiprocessor Tasks 328
9.3 Scheduling with Continuous Resources 342
9.3.1 Introductory Remarks 342
9.3.2 Processing Speed vs. Resource Amount Model 344
9.3.3 Processing Time vs. Resource Amount Model 353
9.3.4 Ready Time vs. Resource Amount Model 358
References 362
10 Scheduling in Flexible Manufacturing Systems 367
10.1 Introductory Remarks 367
10.2 Scheduling Flexible Flow Shops 370
10.2.1 Problem Formulation 370
10.2.2 Heuristics and their Performance 371
10.2.3 Branch and Bound Algorithm 373
10.3 Scheduling Dynamic Job Shops 379
10.3.1 Introductory Remarks 379
10.3.2 Heuristic Algorithm for the Static Problem 380
10.3.3 Computational Experiments 386
10.4 Simultaneous Scheduling and Routing in some FMS 387
10.4.1 Problem Formulation 387
10.4.2 Vehicle Scheduling for a Fixed Production Schedule 389
10.4.3 Simultaneous Job and Vehicle Scheduling 394
10.5 Batch Scheduling in Flexible Flow Shops under Resource Constraints 396
10.5.1 Introduction - Statement of the Problem 396
10.5.2 Mathematical Formulation 398
10.5.3 Heuristic Solution Approach 407
10.5.4 Implementation and Computational Experiment 414
References 415
11 Computer Integrated Production Scheduling 421
11.1 Scheduling in Computer Integrated Manufacturing 422
11.2 A Reference Model for Production Scheduling 427
11.3 IPS: An Intelligent Production Scheduling System 435
11.3.1 Interactive Scheduling 442
11.3.2 Knowledge-Based Systems 456
11.3.3 Integrated Problem Solving 462
References 466
Index 469
END
