Project Scheduling with Time Windows and Scarce Resources : Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions

by Neumann, Klaus; Schwindt, Christoph; Zimmermann, Jurgen

• ISBN13: 9783540424635
• ISBN10: 3540424636
• Format: Paperback
• Copyright: 2001-10-01
• Publisher: Springer Verlag

Summary

The book presents the state of the art of deterministic resource-constrained project scheduling with time windows. General temporal constraints (arising from minimum and maximum time lags between project activities) and several different types of limited resources are considered. A large variety of time-based, financial, and resource-based objectives important in practice are studied. A thorough structural analysis of the feasible region of project scheduling problems and a classification and detailed investigation of objective functions are performed, which can be exploited for developing efficient exact and heuristic solution methods. New interesting applications of project scheduling to production and operations management as well as investment projects are discussed in the second edition.

Table of Contents

Temporal Project Scheduling	1	(20)
Minimum and maximum time lags	1	(5)
Activity-on-node project networks	6	(3)
Temporal project scheduling computations	9	(6)
Orders in the set of activities	15	(6)
Resource--Constrained Project Scheduling - Minimization of Project Duration	21	(154)
Formulation of the problem	24	(2)
Cycle structures in activity-on-node project networks	26	(3)
Properties of the feasible region	29	(9)
Strict orders and order polyhedra	30	(3)
Forbidden sets and resolution of resource conflicts	33	(5)
Different types of shifts and sets of schedules	38	(7)
Branch-and-bound and truncated branch-and-bound methods	45	(35)
Enumeration scheme	45	(8)
Preprocessing	53	(6)
Lower bounds	59	(3)
Branch-and-bound algorithm	62	(3)
Truncated branch-and-bound methods	65	(4)
Alternative enumeration schemes	69	(2)
Alternative preprocessing and constraint propagation	71	(3)
Alternative lower bounds	74	(6)
Priority-rule methods	80	(13)
Direct method	81	(1)
Decomposition methods	82	(1)
Priority rules	83	(1)
Serial generation scheme	84	(6)
Parallel generation scheme	90	(3)
Schedule-improvement procedures	93	(8)
Genetic algorithm	94	(3)
Tabu search	97	(4)
Experimental performance analysis	101	(10)
Random generation of projects	101	(4)
Computational experience	105	(6)
Application to make-to-order production in manufacturing industry	111	(6)
Regular objective functions different from project duration	117	(3)
Calendarization	120	(7)
Project scheduling with cumulative resources	127	(9)
Project scheduling with sequence-dependent changeover times	136	(10)
Multi-mode project scheduling problems	146	(17)
Problem formulation and basic properties	147	(6)
Solution methods	153	(10)
Application to batch production in process industries	163	(12)
Case study	164	(4)
Project scheduling model	168	(3)
Enumeration scheme	171	(4)
Resource--Constrained Project Scheduling -- Minimization of General Objective Functions	175	(126)
Different objective functions	177	(8)
Additional types of shifts and sets of schedules	185	(11)
Classification of objective functions	196	(18)
Separable and resource-utilization dependent objective functions	197	(2)
Class 1 of regular objective functions	199	(1)
Class 2 of antiregular objective functions	200	(1)
Class 3 of convex objective functions	201	(1)
Class 4 of binary-monotone objective functions	202	(1)
Class 5 of quasiconcave objective functions	203	(2)
Class 6 of locally regular objective functions	205	(5)
Class 7 of locally quasiconcave objective functions	210	(4)
Time complexity of time-constrained project scheduling	214	(9)
Relaxation-based approach for function classes 1 to 5	223	(23)
General enumeration scheme	223	(3)
Branch-and-bound algorithm for the net present value problem	226	(17)
Branch-and-bound algorithm for the earliness-tardiness problem	243	(3)
Tree-based approach for function classes 6 and 7	246	(19)
General enumeration scheme	247	(7)
Branch-and-bound algorithms for resource investment, resource levelling, and resource renting problems	254	(10)
Experimental performance analysis	264	(1)
Priority-rule methods	265	(23)
Time-constrained project scheduling	266	(11)
Resource-constrained project scheduling	277	(9)
Experimental performance analysis	286	(2)
Schedule improvement procedures	288	(13)
Neighborhoods for project scheduling problems	288	(9)
A tabu search procedure	297	(4)
References	301	(14)
List of Symbols	315	(6)
Three-Field Classification for Resource-Constrained Project Scheduling	321	(4)
Index	325