ISBN: 3540401253
TITLE: Project Scheduling...
AUTHOR: Neumann, Schwindt, Zimmermann
TOC:

1 Temporal Project Scheduling 1
1.1 Minimum and maximum time lags 1
1.2 Activity-on-node project networks 6
1.3 Temporal project scheduling computations 9
1.4 Orders in the set of activities 16
2 Resource-Constrained Project Scheduling - Minimization of Project Duration 21
2.1 Formulation of the problem 24
2.2 Cycle structures in activity-on-node project networks 27
2.3 Properties of the feasible region 30
2.3.1 Strict orders and order polyhedra 30
2.3.2 Forbidden sets and resolution of resource conflicts 34
2.4 Different types of shifts and sets of schedules 38
2.5 Branch-and-bound and truncated branch-and-bound methods 45
2.5.1 Enumeration scheme 45
2.5.2 Preprocessing 53
2.5.3 Lower bounds 59
2.5.4 Branch-and-bound algorithm 62
2.5.5 Truncated branch-and-bound methods 65
2.5.6 Alternative enumeration schemes 69
2.5.7 Alternative preprocessing and constraint propagation 71
2.5.8 Alternative lower bounds 74
2.6 Priority-rule methods 80
2.6.1 Direct method 81
2.6.2 Decomposition methods 82
2.6.3 Priority rules 83
2.6.4 Serial generation scheme 85
2.6.5 Parallel generation scheme 90
2.7 Schedule-improvement procedures 94
2.7.1 Genetic algorithm 95
2.7.2 Tabu search 98
2.8 Experimental performance analysis 101
2.8.1 Random generation of projects 101
2.8.2 Computational experience 105
2.9 Application to make-to-order production in manufacturing industry 111
2.10 Regular objective functions different from project duration 117
2.11 Calendarization 120
2.12 Project scheduling with cumulative resources 128
2.12.1 Discrete cumulative resources 129
2.12.2 Continuous cumulative resources 138
2.13 Project scheduling with synchronizing resources 145
2.14 Project scheduling with sequence-dependent changeover times 150
2.15 Multi-mode project scheduling problems 160
2.15.1 Problem formulation and basic properties 161
2.15.2 Solution methods 167
2.16 Application to batch production in process industries 177
2.16.1 Case study 179
2.16.2 Batching problem 182
2.16.3 Project scheduling model for batch scheduling 186
2.16.4 Solution procedure for batch scheduling 190
3 Resource-Constrained Project Scheduling - Minimization of General Objective functions 195
3.1 Different objective functions 197
3.2 Additional types of shifts and sets of schedules 207
3.3 Classification of objective functions 218
3.3.1 Separable and resource-utilization dependent objective functions 219
3.3.2 Class 1 of regular objective functions 221
3.3.3 Class 2 of antiregular objective functions 222
3.3.4 Class 3 of convex objective functions 223
3.3.5 Class 4 of binary-monotone objective functions 224
3.3.6 Class 5 of quasiconcave objective functions 225
3.3.7 Class 6 of locally regular objective functions 227
3.3.8 Class 7 of locally quasiconcave objective functions 232
3.4 Time complexity of time-constrained project scheduling 236
3.5 Relaxation-based approach for function classes 1 to 5 246
3.5.1 General enumeration scheme 246
3.5.2 Branch-and-bound algorithm for the net present value problem 250
3.5.3 Branch-and-bound algorithm for the earliness-tardiness problem 266
3.6 Tree-based approach for function classes 6 and 7 269
3.6.1 General enumeration scheme 270
3.6.2 Branch-and-bound algorithms for resource investment, resource levelling, and resource renting problems 277
3.6.3 Experimental performance analysis 288
3.6.4 Alternative lower bounds 289
3.7 Priority-rule methods 296
3.7.1 Time-constrained project scheduling 296
3.7.2 Resource-constrained project scheduling 308
3.7.3 Experimental performance analysis 317
3.8 Schedule-improvement procedures 319
3.8.1 Neighborhoods for project scheduling problems 319
3.8.2 A tabu search procedure 328
3.9 Application to investment projects 329
3.9.1 Computation of the net present value function 333
3.9.2 Decision support 339
3.10 Hierarchical project planning 342
References 347
List of Symbols 363
Three-Field Classification for Resource-Constrained Project Scheduling 369
END
