Flexibility and Robustness in Scheduling

Preface. Chapter 1. Introduction to Flexibility and Robustness in Scheduling (Jean-Charles Billaut, Aziz Moukrim an Eric Sanlaville). Chapter 2. Robustness in Operations Research and Decision Aiding (Bernard Roy). Chapter 3. The Robustness of Multi-Purpose Machines Workshop Configuration (Marie-Laure Espinouse, Mireille Jacomino and Andre Rossi). Chapter 4. Sensitivity Analysis for One and m Machines (Amine Mahjoub, Aziz Moukrim, Christophe Rapine and Eric Sanlaville). Chapter 5. Service Level in Scheduling (Stephane Dauzere-Peres, Philippe Castagliola and Chams Lahlou). Chapter 6. Metaheuristics for Robust Planning and Scheduling (Marc Sevaux, Kenneth Sorensen and Yann Le Quere). Chapter 7. Metaheuristics and Performance Evaluation Models for the Stochastic Permutation Flow-Shop Scheduling Problem (Michel Gourgand, Nathalie Grangeon and Sylvie Norre). Chapter 8. Resource Allocation for the Construction of Robust Project Schedules (Christian Artigues, Roel Leus and Willy Herroelen). Chapter 9. Constraint-based Approaches for Robust Scheduling (Cyril Briand, Marie-Jose Huguet, Hoang Trung La and Pierre Lopez). Chapter 10. Scheduling Operation Groups: A Multicriteria Approach to Provide Sequential Flexibility (Carl Esswein, Jean-Charles Billaut and Christian Artigues). Chapter 11. A Flexible Proactive-Reactive Approach: The Case of an Assembly Workshop (Mohamed Ali Aloulou and Marie-Claude Portmann). Chapter 12. Stabilization for Parallel Applications (Amine Mahjoub, Jonathan E. Pecero Sanchez and Denis Trystram). Chapter 13. Contribution to a Proactive/Reactive Control of Time Critical Systems (Pascal Aygalinc, Soizick Calvez and Patrice Bonhomme). Chapter 14. Small Perturbations on Some NP-Complete Scheduling Problems (Christophe Picouleau). List of Authors. Index.

[1]  Genaro J. Gutierrez,et al.  Parkinson's Law and Its Implications for Project Management , 1991 .

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[4]  P. C. Bagga.  Sequencing With Random Service Times , 1970 .

[5]  J. Branke.  Reducing the sampling variance when searching for robust solutions , 2001 .

[6]  G. NAEGLER,et al.  Chapter 8 – RESOURCE ALLOCATION IN A NETWORK MODEL - THE LEINET SYSTEM , 1989 .

[7]  Denis Trystram,et al.  Scheduling Precedence Task Graphs with Disturbances , 2003, RAIRO Oper. Res..

[8]  Pierre Lopez.  Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources. (Energy-based approach for task scheduling under time and resource constraints) , 1991 .

[9]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

[10]  Eric Sanlaville,et al.  Scheduling with Communication Delays and On-Line Disturbances , 1999, Euro-Par.

[11]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[12]  Pierre Lopez,et al.  Constraint Propagation and Scheduling , 2010 .

[13]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[14]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Jerzy Kamburowski,et al.  A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation , 2006, Eur. J. Oper. Res..

[16]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[17]  Christophe Picouleau.  New Complexity Results on Scheduling with Small Communication Delays , 1995, Discret. Appl. Math..

[18]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[19]  J. Erschler,et al.  Ordonnancement de tâches sous contraintes: une approche énergetique , 1992 .

[20]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[21]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[22]  Tao Yang,et al.  List Scheduling With and Without Communication Delays , 1993, Parallel Comput..

[23]  Shigeyoshi Tsutsui,et al.  Genetic algorithms with a robust solution searching scheme , 1997, IEEE Trans. Evol. Comput..

[24]  James F. Allen.  An Interval-Based Representation of Temporal Knowledge , 1981, IJCAI.

[25]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[26]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[27]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[28]  Pierre Lopez,et al.  Overview and Possible Extensions of Shaving Techniques for Job-Shop Problems ! , 2000 .

[29]  R. Lathe.  Phd by thesis , 1988, Nature.

[30]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[31]  François Laburthe,et al.  Cumulative Scheduling with Task Intervals , 1996, JICSLP.

[32]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[33]  Jacques Carlier,et al.  A new LP-based lower bound for the cumulative scheduling problem , 2000, Eur. J. Oper. Res..

[34]  Yang Tao,et al.  Applications of Graph Scheduling Techniques in Parallelizing Irregular Scientific Computation , 1995 .

[35]  A. Gall.  Un système interactif d'aide à la décision pour l'ordonnancement et le pilotage en temps réel d'atelier , 1989 .

[36]  D. R. Fulkerson.  Expected Critical Path Lengths in PERT Networks , 1962 .

[37]  Stéphane Dauzère-Pérès,et al.  Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine , 2003 .

[38]  Cyril Briand,et al.  Activity Insertion Problem in a RCPSP with Minimum and Maximum Time Lags , 2008 .

[39]  Jane N. Hagstrom,et al.  Computational complexity of PERT problems , 1988, Networks.

[40]  Joseph Sifakis,et al.  Use of Petri nets for performance evaluation , 1977, Acta Cybern..

[41]  John Bowers,et al.  Criticality in Resource Constrained Networks , 1995 .

[42]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

[43]  Gunhild Waldemar,et al.  Denmark , 2007, Practical Neurology.

[44]  Pascal Van Hentenryck.  Improved CLP Scheduling with Task Intervals , 1994 .

[45]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[46]  Sujit K. Dutta,et al.  Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop , 1973 .

[47]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[48]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[49]  Christian Artigues.  Ordonnancement en temps réel d'ateliers avec temps de préparation des ressources , 1997 .

[50]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[51]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[52]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[53]  F. J. Radermacher,et al.  Chapter 4 – THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE STOCHASTIC CASE , 1989 .

[54]  Patrick Sénac,et al.  Time Stream Petri Nets: A Model for Timed Multimedia Information , 1994, Application and Theory of Petri Nets.

[55]  Carl Esswein,et al.  Un apport de flexibilité séquentielle pour l'ordonnancement robuste , 2003 .

[56]  Marc E. Posner,et al.  Sensitivity Analysis for Scheduling Problems , 2004, J. Sched..

[57]  Mohamed Ali Aloulou,et al.  Incorporating flexibility in job sequencing for the single machine total weighted tardiness problem with release dates , 2001 .

[58]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[59]  F. Roubellat,et al.  Ordonnancement d'atelier en temps réel : d'ORABAID à ORDO , 1995 .

[60]  Christian Artigues,et al.  Insertion techniques for static and dynamic resource-constrained project scheduling , 2003, Eur. J. Oper. Res..

[61]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[62]  Erwin Pesch,et al.  Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..

[63]  Pierre Lopez.  Approche par contraintes des problèmes d'ordonnancement et d'affectation : structures temporelles et mécanismes de propagation. (A Constraint-based Approach for Scheduling and Allocation: Temporal Structures and Propagation Mechanisms) , 2003 .

[64]  Denis Trystram,et al.  Sensitivity analysis of scheduling algorithms , 2001, Eur. J. Oper. Res..

[65]  J. Erschler,et al.  Applying new dominance concepts to job schedule optimization , 1982 .

[66]  Thomas Goldstein.  Algorithms and Applications for L1 Minimization , 2010 .

[67]  P. Winkler.  Random orders , 1985 .

[68]  Panos Kouvelis,et al.  Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .

[69]  Pierre Lopez,et al.  Modelling and managing disjunctions in scheduling problems , 1995, J. Intell. Manuf..

[70]  F. Roubellat,et al.  A new method for workshop real time scheduling , 1996 .

[71]  Hugh Garraway.  Parallel Computer Architecture: A Hardware/Software Approach , 1999, IEEE Concurrency.

[72]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[73]  Patrice Bonhomme,et al.  Proactive/reactive approach for maintenance tasks in time critical systems , 2005, 2005 IEEE Conference on Emerging Technologies and Factory Automation.

[74]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[75]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[76]  Christian Artigues,et al.  Real‐Time Workshop Scheduling , 2010 .

[77]  Eddie Schwalb,et al.  Temporal Constraints: A Survey , 1998, Constraints.

[78]  Kenneth Sörensen,et al.  A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates , 2004, 4OR.

[79]  Toji Makino.  ON A SCHEDULING PROBLEM , 1965 .

[80]  P P Talwar,et al.  A NOTE ON SEQUENCING PROBLEM WITH UNCERTAIN JOB TIMES , 1967 .

[81]  D. Prowe.  Berlin , 1855, Journal of public health, and sanitary review.

[82]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[83]  Laurent Péridy.  Le problème de job-shop : arbitrages et ajustements , 1996 .

[84]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[85]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[86]  F G Forst.  A REVIEW OF THE STATIC STOCHASTIC SEQUENCING LITERATURE , 1973 .

[87]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[88]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[89]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[90]  Nicola Muscettola,et al.  Dynamic Control Of Plans With Temporal Uncertainty , 2001, IJCAI.

[91]  P. Aygalinc,et al.  Structural analysis of p-time Petri nets , 1996 .

[92]  Willy Herroelen,et al.  Stability and resource allocation in project planning , 2004 .

[93]  Denis Trystram,et al.  A new clustering algorithm for large communication delays , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[94]  J. A. Salvato.  John wiley & sons. , 1994, Environmental science & technology.

[95]  Jürgen Branke,et al.  Creating Robust Solutions by Means of Evolutionary Algorithms , 1998, PPSN.

[96]  Jin-Kao Hao,et al.  Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes , 1999 .

[97]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[98]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[99]  Michel Gourgand,et al.  A review of the static stochastic flow-shop scheduling problem , 2000, J. Decis. Syst..

[100]  M. Portmann,et al.  Genetic algorithm operators restricted to precedent constraint sets: genetic algorithm designs with or without branch and bound approach for solving scheduling problems with disjunctive constraints , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[101]  O. H. Lowry.  Academic press. , 1972, Analytical chemistry.

[103]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[104]  Michel Gourgand,et al.  Markovian analysis for performance evaluation and scheduling in m , 2005, Eur. J. Oper. Res..

[105]  M. Gourgand,et al.  Couplage méthodes d'ordonnancement-simulation pour l'ordonnancement de systèmes industriels de traitement de surface , 1995 .

[106]  Erik Demeulemeester,et al.  Proactive-reactive project scheduling , 2010 .

[107]  Erik Demeulemeester,et al.  Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities , 2008, J. Sched..

[108]  Kluwer academic publishers acquires ESCOM science publishers , 1997 .

[109]  Wael Khansa.  Réseaux de Pétri P-Temporels : contribution à l'étude des systèmes à évènements discrets , 1997 .

[110]  Willy Herroelen,et al.  The construction of stable project baseline schedules , 2004, Eur. J. Oper. Res..

[111]  Mohamed Ali Aloulou.  Structure flexible d'ordonnancements à performances contrôlées pour le pilotage d'atelier en présence de perturbations , 2002 .

[112]  Christian Artigues,et al.  A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..

[113]  Mohamed Ali Aloulou,et al.  Maximization of single machine scheduling , 2004 .

[114]  R. H. Mak,et al.  Eindhoven University of Technology MASTER BPM in the cloud , .

[115]  김미정.  대학의 브랜드로서의 이미지에 관한 연구 -미국 캘리포니아 주립대학교(University of California) 10개 캠퍼스의 로고(LOGO) 및 문장(紋章, Seal)을 중심으로- , 2009 .

[116]  R. Möhring.  Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .

[117]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[118]  Chunfu Jia.  Minimizing variation in stochastic flow shop , 1998, Oper. Res. Lett..

[119]  Dan Trietsch,et al.  Johnson's problem with stochastic processing times and optimal service level , 2006, Eur. J. Oper. Res..

[120]  Philippe Lacomme,et al.  Evolutionary Algorithms for Stochastic Arc Routing Problems , 2004, EvoWorkshops.

[121]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[122]  Pierre Lopez,et al.  Characterisation by decomposition in scheduling , 1998 .

[123]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[124]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[125]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[126]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[127]  F. G. Forst.  Minimizing total expected costs in the two-machine, stochastic flow shop , 1983 .

[128]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[129]  Patrice Bonhomme,et al.  Using firing instants approach and partial order to control time critical systems , 2003, EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696).

[130]  Gilles Fedak,et al.  Global Computing Systems , 2001, LSSC.

[131]  Jean-Charles Billaut,et al.  Maximization of solution flexibility for robust shop scheduling , 2005, Eur. J. Oper. Res..

[132]  Mohamed Ali Aloulou,et al.  Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity , 2007, RAIRO Oper. Res..

[133]  Jean-Charles Billaut,et al.  Two-machine shop scheduling: Compromise between flexibility and makespan value , 2005, Eur. J. Oper. Res..

[134]  Franz Josef Radermacher,et al.  Algorithmic approaches to preselective strategies for stochastic scheduling problems , 1983, Networks.

[135]  Hanifa Boucheneb,et al.  Towards a simplified building of time Petri Nets reachability graph , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[136]  Rolf H. Möhring,et al.  Scheduling under Uncertainty: Bounding the Makespan Distribution , 2001, Computational Discrete Mathematics.

[137]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

[138]  Cyril Briand,et al.  A new sufficient condition of optimality for the two-machine flowshop problem , 2006, Eur. J. Oper. Res..

[139]  S. Calvez,et al.  P-Time Petri Nets for Manufacturing Systems with Staying Time Constraints , 1997 .

[140]  Christian Artigues,et al.  Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems , 2007, ICCSA.

[141]  Shun-Chen Niu,et al.  On Johnson's Two-Machine Flow Shop with Random Processing Times , 1986, Oper. Res..

[142]  Christian Artigues,et al.  Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case , 2010, Comput. Oper. Res..

[143]  Peter Brucker,et al.  Scheduling and constraint propagation , 2002, Discret. Appl. Math..

[144]  Michel Gourgand,et al.  A contribution to the stochastic flow shop scheduling problem , 2003, Eur. J. Oper. Res..

[145]  Jerzy Kamburowski,et al.  Stochastically minimizing the makespan in two-machine flow shops without blocking , 1999, Eur. J. Oper. Res..

[146]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[147]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[148]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[149]  Kenneth Sörensen,et al.  Tabu Searching for Robust Solutions , 2001 .

[150]  Pierre Lopez,et al.  Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine , 1999, RAIRO Oper. Res..

[151]  Patrice Bonhomme,et al.  Robust control for time-critical systems , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[152]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[153]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

[154]  Cyril Briand,et al.  A robust approach for the single machine scheduling problem , 2007, J. Sched..

[155]  Pierre Lopez,et al.  On Not-First/Not-Last conditions in disjunctive scheduling , 2000, Eur. J. Oper. Res..

[156]  Philippe Baptiste,et al.  Résultats de complexité et programmation par contraintes pour l'ordonnancement , 2002 .

[157]  K. Sörensen,et al.  A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design , 2003 .

[158]  Shigeyoshi Tsutsui,et al.  A comparative study on the effects of adding perturbations to phenotypic parameters in genetic algorithms with a robust solution searching scheme , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[159]  K. Roberts,et al.  Thesis , 2002 .

[160]  Eric Pinson,et al.  Jackson's pseudo-preemptive schedule and cumulative scheduling problems , 2004, Discret. Appl. Math..

[161]  Paul Stephenson,et al.  Fast algorithms to minimize the makespan or maximum lateness in the two‐machine flow shop with release times , 2002 .

[162]  D. E. Goldberg,et al.  Optimization and Machine Learning , 2022 .

[163]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[164]  Glenn K. Manacher,et al.  Production and Stabilization of Real-Time Task Schedules , 1967, JACM.

[165]  Stéphane Dauzère-Pérès,et al.  Minimizing late jobs in the general one machine scheduling problem , 1995 .

[166]  Franz Josef Radermacher,et al.  Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[167]  S. Suresh,et al.  Stochastically minimizing the makespan in flow shops , 1984 .

[168]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .