Complex Scheduling

1. Front Matter

   Pages i-x

   PDF

2. Scheduling Models

   Pages 1-22

3. Algorithms and Complexity

   Pages 23-90

4. Resource-Constrained Project Scheduling

   Pages 91-188

5. Complex Job-Shop Scheduling

   Pages 189-267

6. Back Matter

   Pages 269-284

   PDF

Scheduling problems have been investigated since the late ?fties. Two types of applications have mainly motivated research in this area: project planning and machine scheduling. While in machine scheduling a large number of speci?c scheduling situations depending on the machine environment and the job c- racteristicshavebeenconsidered, theearlyworkinprojectplanninginvestigated scheduling situations with precedence constraints between activities assuming that su?cient resources are available to perform the activities. More recently, in project scheduling scarce resources have been taken into account leading to so-called resource-constrained project scheduling problems. On the other hand, also in machine scheduling more general and complex problems have been - vestigated. Due to these developments today both areas are much closer to each other. Furthermore, applications like timetabling, rostering or industrial scheduling are connected to both areas. This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into discrete optimization (covering complexity, shortest path algorithms, linear programming, network ?ow algorithms and general optimization methods). In the second part (Chapter 3) resource-constrained project scheduling problems are considered. Especially, methods like constraint propagation, branch-a- bound algorithms and heuristic procedures are described. Furthermore, lower bounds and general objective functions are discussed.

• Discrete Optimization
• Job-Shop Problems
• Optimization Methods
• Project Planning
• Scheduling
• algorithm
• algorithms
• complexity
• genetic algorithms
• optimization
• programming
• algorithm analysis and problem complexity

From the reviews:

"This monograph deals with complex scheduling problems and typical solution approaches for them. … This book gives a good and well readable introduction into such complex scheduling problems with a review of current solution techniques. Most algorithms for the exact and heuristic solution of the problem types considered are given in detail, and they are often illustrated with an example. The monograph can be recommended both for researchers and practitioners." (Frank Werner, Zentralblatt MATH, Vol. 1154, 2009)

• Universität Osnabrück Fachbereich Mathematik/Informatik, Osnabrück

  Peter Brucker, Sigrid Knust

Policies and ethics