Project scheduling with time windows and scarce resources : temporal and resource-constrained project scheduling with regular and nonregular objective functions

Klaus Neumann, Christoph Schwindt, Jürgen Zimmermann

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.

「Nielsen BookData」より

[目次]

  • 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.

「Nielsen BookData」より

この本の情報

書名 Project scheduling with time windows and scarce resources : temporal and resource-constrained project scheduling with regular and nonregular objective functions
著作者等 Neumann, Klaus
Zimmermann, H.-J.
Zimmermann Jurgen
Schwindt Christoph
出版元 Springer-Verlag
刊行年月 c2003
版表示 2nd ed
ページ数 xiii, 385 p.
大きさ 24 cm
ISBN 3540401253
NCID BA63763907
※クリックでCiNii Booksを表示
言語 英語
出版国 ドイツ
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想