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

Neumann, Klaus; Schwindt, Christoph; Zimmermann, Jurgen

Rilegato

ISBN 10: 3540401253 ISBN 13: 9783540401254

Casa editrice: Springer Nature, 2003

Riassunto

A survey of the state of the art of deterministic resource-constrained project scheduling with time windows. General temporal constraints 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.

Su questo libro

Recensione

From the reviews of the second edition:

"The book deals with so-called temporal project scheduling with schedule-dependent time windows. ... Overall, the book has produced a fairly comprehensive and well-organized treatment of these topics. ... the authors have done a terrific job of binding them–including many of their own contributions–together in a coherent way. ... Their well- grounded choices make the technical details easier to follow. ... As such, the book represents a noteworthy addition to project-scheduling reference list for both academicians and practitioners alike." (J Xue, Journal of the Operational Research Society, Vol. 56, 2005)

"The book presents a state of the art in the sub-field of scheduling theory, i.e. the project scheduling under scarce resources written by well known experts in the field. Although several books have been recently published in that area, one can observe a number of features which distinguish this book from the others. ... The book is thoroughly written and the mathematics used is adequate to the needs. It contains also many algorithms described in pseudo-code. Several examples complement nicely their presentation." (Jacek Blazewicz, Zentralblatt MATH, Vol. 1059 (10), 2005)

"The book presents the state of the art of deterministic resource-constrained project scheduling with time windows. ... 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." (GfPMagazin – online, April, 2005)

"At last a professional book dealing with the exact formulation of project scheduling. When I obtained it I first couldn’t believe that there is really a book with definitions, propositions, proofs, lemmas and theorems about how to schedule activities with the metra potential method. Fortunately, there are also a lot of examples and concrete algorithms that describe simple scheduling tasks as well as schedule-improvement procedures. ... The book is truly scientific, you find e.g. a comprehensive list of references of more than 200 scientific publications." (Dr. Georg Angermeier, www.projektmagazin.de, August, 2004)

Contenuti

1 Temporal Project Scheduling.- 1.1 Minimum and maximum time lags.- 1.2 Activity-on-node project networks.- 1.3 Temporal project scheduling computations.- 1.4 Orders in the set of activities.- 2 Resource-Constrained Project Scheduling — Minimization of Project Duration.- 2.1 Formulation of the problem.- 2.2 Cycle structures in activity-on-node project networks.- 2.3 Properties of the feasible region.- 2.3.1 Strict orders and order polyhedra.- 2.3.2 Forbidden sets and resolution of resource conflicts.- 2.4 Different types of shifts and sets of schedules.- 2.5 Branch-and-bound and truncated branch-and-bound methods.- 2.5.1 Enumeration scheme.- 2.5.2 Preprocessing.- 2.5.3 Lower bounds.- 2.5.4 Branch-and-bound algorithm.- 2.5.5 Truncated branch-and-bound methods.- 2.5.6 Alternative enumeration schemes.- 2.5.7 Alternative preprocessing and constraint propagation.- 2.5.8 Alternative lower bounds.- 2.6 Priority-rule methods.- 2.6.1 Direct method.- 2.6.2 Decomposition methods.- 2.6.3 Priority rules.- 2.6.4 Serial generation scheme.- 2.6.5 Parallel generation scheme.- 2.7 Schedule-improvement procedures.- 2.7.1 Genetic algorithm.- 2.7.2 Tabu search.- 2.8 Experimental performance analysis.- 2.8.1 Random generation of projects.- 2.8.2 Computational experience.- 2.9 Application to make-to-order production in manufacturing industry.- 2.10 Regular objective functions different from project duration.- 2.11 Calendarization.- 2.12 Project scheduling with cumulative resources.- 2.12.1 Discrete cumulative resources.- 2.12.2 Continuous cumulative resources.- 2.13 Project scheduling with synchronizing resources.- 2.14 Project scheduling with sequence-dependent changeover times.- 2.15 Multi-mode project scheduling problems.- 2.15.1 Problem formulation and basic properties.- 2.15.2 Solution methods.- 2.16 Application to batch production in process industries.- 2.16.1 Case study.- 2.16.2 Batching problem.- 2.16.3 Project scheduling model for batch scheduling.- 2.16.4 Solution procedure for batch scheduling.- 3 Resource-Constrained Project Scheduling — Minimization of General Objective Functions.- 3.1 Different objective functions.- 3.2 Additional types of shifts and sets of schedules.- 3.3 Classification of objective functions.- 3.3.1 Separable and resource-utilization dependent objective functions.- 3.3.2 Class 1 of regular objective functions.- 3.3.3 Class 2 of antiregular objective functions.- 3.3.4 Class 3 of convex objective functions.- 3.3.5 Class 4 of binary-monotone objective functions.- 3.3.6 Class 5 of quasiconcave objective functions.- 3.3.7 Class 6 of locally regular objective functions.- 3.3.8 Class 7 of locally quasiconcave objective functions.- 3.4 Time complexity of time-constrained project scheduling.- 3.5 Relaxation-based approach for function classes 1 to 5.- 3.5.1 General enumeration scheme.- 3.5.2 Branch-and-bound algorithm for the net present value problem.- 3.5.3 Branch-and-bound algorithm for the earliness-tardiness problem.- 3.6 Tree-based approach for function classes 6 and 7.- 3.6.1 General enumeration scheme.- 3.6.2 Branch-and-bound algorithms for resource investment, resource levelling, and resource renting problems.- 3.6.3 Experimental performance analysis.- 3.6.4 Alternative lower bounds.- 3.7 Priority-rule methods.- 3.7.1 Time-constrained project scheduling.- 3.7.2 Resource-constrained project scheduling.- 3.7.3 Experimental performance analysis.- 3.8 Schedule-improvement procedures.- 3.8.1 Neighborhoods for project scheduling problems.- 3.8.2 A tabu search procedure.- 3.9 Application to investment projects.- 3.9.1 Computation of the net present value function.- 3.9.2 Decision support.- 3.10 Hierarchical project planning.- References.- List of Symbols.- Three-Field Classification for Resource-Constrained Project Scheduling.

Dettagli dell'edizione

• Editore: Springer Nature
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 3540401253
• ISBN 13: 9783540401254
• Rilegatura: Copertina rigida
• Numero edizione: 2
• Numero di pagine: 385
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania