Brucker P., Knust S. Complex Scheduling

2nd Edition. — Springer, 2012. — 348 p. — (GOR Publications). — ISBN: 3642239285.Scheduling problems have been investigated since the late fifties. Two types of applications have mainly motivated research in this area: project planning and machine scheduling. While in machine scheduling a large number of specific scheduling situations depending on the machine environment and the job characteristics have been considered, the early work in project planning investigated scheduling situations with precedence constraints between activities assuming that sufficient 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 investigated. 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.Scheduling Models
Algorithms and Complexity
Resource-Constrained Project Scheduling
Complex Job-Shop Scheduling