Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications
April 2008, Wiley-ISTE
In the first part, the standard variant of RCPSP is presented and analyzed as a combinatorial optimization problem. Constraint programming and integer linear programming formulations are given. Relaxations based on these formulations and also on related scheduling problems are presented. Exact methods and heuristics are surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided.
The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations.
The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
Chapter 1. The resource-constrained project scheduling problem (Christian Artigues, Sophie Demassey and Emmanuel Néron).
Chapter 2. Standard scheduling subproblems (Christian Artigues, Sophie Demassey and Emmanuel Néron).
Chapter 3. Integer linear programming formulations and relaxations (Christian Artigues, Sophie Demassey and Emmanuel Néron).
Chapter 4. Constraint programming formulations and filtering algorithms (Philippe Laborie and Wim Nuijten).
Chapter 5. Lower bounds (Christian Artigues, Sophie Demassey and Emmanuel Néron).
Chapter 6. Exact methods (Christian Artigues, Sophie Demassey and Emmanuel Néron).
Chapter 7. Heuristics (Christian Artigues and David Rivreau).
Chapter 8. Computational experiments (Christian Artigues, Sophie Demassey, Philippe Laborie, Emmanuel Néron and David Rivreau).
Part 2: Variants and extensions.
Chapter 9. Preemptive activities (Jean Damay).
Chapter 10. Multi-mode activities and multiskill resources (Odile Bellenguez and Emmauel Néron).
Chapter 11. Project scheduling with production and consumption of resources (Jacques Carlier, Aziz Moukrim and Huang Xu).
Chapter 12. Maximal time lags (Christian Artigues and Cyril Briand).
Chapter 13. Reactive project scheduling (Narendra Jussien and Christelle Guéret).
Chapter 14. Proactive-reactive project scheduling (Erik Demeulemeester, Willy Herroelen and Roel Leus).
Chapter 15. Cost-based RCPSP (Laure-Emmanuelle-Drezet).
Part 3: Industrial applications.
Chapter 16. Assembly shop scheduling (Michel Gourgand, Nathalie Grangeon and Sylvie Norre).
Chapter 17. Employee scheduling in an IT company (Laure-Emmanuelle Drezet and Jean-Charles Billaut).
Chapter 18. Rolling ingots production scheduling (Christoph Schwindt and Norbert Trautmann).
Chapter 19. VLIW instruction scheduling (Christian Artigues, Sadia Azem and Benoit Dupont de Dinechin).
Architecture of Systems (LAAS) of the French National Institute for
Scientific Research (CNRS).
Sophie Demassey is an Assistant Professor at the School of Mining Engineering (EMN), Nantes, France.
Emmanuel Néron is Assistant Professor at the Computer Science Department of Polytech'Tours, France, and is a member of the Computer Science Laboratory of the University of Tours, France.
Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications (US $160.00)
-and- Bioinformatics Algorithms: Techniques and Applications (US $160.00)
Total List Price: US $320.00
Discounted Price: US $240.00 (Save: US $80.00)