Project scheduling. A research handbook. (Q1422056): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Erik L. Demeulemeester / rank | |||
Property / author | |||
Property / author: Q213375 / rank | |||
Property / author | |||
Property / author: Erik L. Demeulemeester / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Willy S. Herroelen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Project scheduling. A research handbook. |
scientific article |
Statements
Project scheduling. A research handbook. (English)
0 references
17 February 2004
0 references
In this book the authors give a survey about the current research in the area of project scheduling. A large number of state-of-the-art algorithms (exact and heuristic solution procedures) are described for different project scheduling problems and illustrated with examples and computational results. Furthermore, the book contains exercises in each chapter and a huge number of literature references. The book is divided into four parts. In the first part a general introduction to project scheduling and its relevance in practice is given. Furthermore, a classification scheme to distinguish different project scheduling problems is proposed. The second part is devoted to the temporal analysis of project networks where no resource but temporal constraints are given. Project scheduling problems with resource constraints are treated in the third part. Especially, many exact branch-and-bound algorithms, heuristic procedures and lower bound calculations are discussed and compared. Afterwards, several generalizations are considered (generalized precedence relations with time-lags, multiple modes, preemptive problems, time-cost tradeoff problems, resource levelling problems, problems with nonregular objective functions like earliness/tardiness or the net present value). Finally, the fourth part covers stochastic, robust and reactive scheduling.
0 references
project scheduling
0 references
heuristics
0 references
exact algorithms
0 references
resources
0 references