Flexibility and Robustness in Scheduling
Book
Hardback
352 pages
978-1-905209-75-0 (ISBN)
Description
Scheduling is a wide research area, and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and reactive or "on-line" approaches. It exists when some information concerning the problem is known, which may not be perfect but which is fairly reliable and where it is likely that there will be a difference between the forecasted plan and its execution. The purpose of flexibility is to provide one or more solutions adapted to the context of the application in order to provide the ideal solution. Robustness characterizes the performance of an algorithm when data are subject to uncertainty, being the ability to be resisted to approximations and ignorance. This book focuses on the integration of flexibility and robustness considerations in the study of scheduling problems. After considering both flexibility and robustness, it then covers various scheduling problems, treated with an emphasis on flexibility or robustness, or both.
More details
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Dimensions
Height: 234 mm
Width: 156 mm
ISBN-13
978-1-905209-75-0 (9781905209750)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Jean Billaut is Professor in Computer Science in the Polytechnic School of the University of Tours, France. He teaches assembly language and operational research (graph theory and dynamic programming). He is member of the board of the French OR Society (President in 2006 and 2007). Aziz Moukrim is Professor in Computer Science at the University of Technology of Compiegne, France, and is a member of the UTC-CNRS research laboratory (Heudiasyc). He teaches algorithmic and operational research (scheduling, logistics and transportation systems). He is co-leader of the CNRS Group (Scheduling and Transportation Networks). Eric Sanlaville is Associate Professor in Computer Science at the University of Clermont-Ferrand, France. He teaches algorithmics and operational research (both in deterministic and stochastic settings). He has been a member of the board of the French OR Society since 2004
Content
1. Introduction. 2. On robustness in operations research and decision aiding - Bernard Roy. 3. About robust configurations for multipurpose machines - Marie-Laure Espinouse, Mireille Jacomino, Andre Rossi. 4. Sensitivity analyses for one and more machines - Amine Mahjoub, Aziz Moukrim, Christophe Rapine, Eric Sanlaville. 5. Service level in scheduling - Stephane Dauzere-Peres, Philippe Castagliola, Chams Lahlou. 6. Metaheuristics for robust planning and scheduling - Marc Sevaux, Kenneth Sorensen, Yann Le Quere. 7. Model of permutation stochastic flowshop - Michel Gourgand, Nathalie Grangeon, Sylvie Norre. 8. Resource allocation in project planning - Christian Artigues, Roel Leus, Willy Herroelen. 9. Constraint based approaches for robust scheduling - Cyril Briand, Marie-Jose Huguet, Hoang Trung La, Pierre Lopez. 10. Scheduling groups: a multicriteria approach to provide sequential flexibility - Carl Esswein, Jean-Charles Billaut, Christian Artigues. 11. A flexible proactive reactive approach: the case of an assembly workshop - Mohamed Ali Aloulou, Marie-Claude Portmann. 12. Stabilization of parallel applications - Amine Mahjoub, Denis Trystram. 13. Contributions of a proactive/reactive approach to control time critical systems - Pascal Aygalinc, Soizick Calvez, Patrice Bonhomme. 14. Small perturbations on the data of NP-complete scheduling problems - Christophe Picouleau. 15. Dynamic project scheduling - Abdallah Elkhyari, Christelle Gueret, Narendra Jussien.