A theoretic and practical framework for scheduling in a stochastic environment

There are many systems and techniques that address stochastic planning and scheduling problems, based on distinct and sometimes opposite approaches, especially in terms of how generation and execution of the plan, or the schedule, are combined, and if and when knowledge about the uncertainties is taken into account. In many real-life problems, it appears that many of these approaches are needed and should be combined, which to our knowledge has never been done. In this paper, we propose a typology that distinguishes between proactive, progressive, and revision approaches. Then, focusing on scheduling and schedule execution, a theoretic model integrating those three approaches is defined. This model serves as a general template to implement a system that will fit specific application needs: we introduce and discuss our experimental prototypes which validate our model in part, and suggest how this framework could be extended to more general planning systems.

[1]  J. Christopher Beck,et al.  Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations , 2011, J. Artif. Intell. Res..

[2]  Thierry Vidal,et al.  CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning , 2003, Constraints.

[3]  Ihsan Sabuncuoglu,et al.  Analysis of reactive scheduling problems in a job shop environment , 2000, Eur. J. Oper. Res..

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

[5]  J. Christopher Beck,et al.  Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling , 1999 .

[6]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[7]  John L. Bresina,et al.  Just-In-Case Scheduling , 1994, AAAI.

[8]  Hoang Trung La.  Utilisation d'ordres partiels pour la caractérisation de solution robustes en ordonnancement , 2005 .

[9]  Stephen F. Smith,et al.  Generating Robust Partial Order Schedules , 2004, CP.

[10]  Matt Brown,et al.  Invited talk , 2007 .

[11]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[12]  J. Christopher Beck,et al.  Slack-based Techniques for Robust Schedules , 2014 .

[13]  J. Christopher Beck,et al.  Constraint-directed techniques for scheduling alternative activities , 2000, Artif. Intell..

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

[15]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[16]  Jean-Charles Billaut,et al.  Flexibility and Robustness in Scheduling , 2008 .

[17]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[18]  J. Christopher Beck,et al.  Using simuation for execution monitoring and on-line rescheduling with uncertain durations , 2003 .

[19]  Rob Sherwood,et al.  Using Iterative Repair to Increase the Responsiveness of Planning and Scheduling for Autonomous Spacecraft , 1999 .

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

[21]  Thomas Schiex,et al.  Mixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge , 1996, AAAI/IAAI, Vol. 1.

[22]  Rachid Alami,et al.  Incremental mission allocation to a large team of robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[23]  Félix Ingrand,et al.  Interleaving Temporal Planning and Execution in Robotics Domains , 2004, AAAI.

[24]  J. Christopher Beck,et al.  USING CONSTRAINT PROGRAMMING AND SIMULATION FOR EXECUTION MONITORING AND PROGRESSIVE SCHEDULING , 2006 .

[25]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment , 1999 .

[26]  M. S. Akturk,et al.  A new dominance rule for the total weighted tardiness problem , 1999 .

[27]  Fahiem Bacchus,et al.  Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002) , 2002, AAAI 2002.

[28]  David E. Smith,et al.  Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI , 2002, AIPS Workshop on Planning for Temporal Domains.

[29]  Nicola Muscettola,et al.  Computing the Envelope for Stepwise-Constant Resource Allocations , 2002, CP.

[30]  Rob Sherwood,et al.  Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling , 2000, AIPS.

[31]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[32]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[33]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[34]  David W. Hildum.  Flexibility in a Knowledge-Based System for Solving Dynamic Resource-Constrained Scheduling Problems , 1994 .

[35]  Didier Dubois,et al.  The Use of Fuzzy Constraints in Job-Shop Scheduling. , 1994 .

[36]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

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

[38]  Xuemei Wang,et al.  Replanning Using Hierarchical Task Network and Operator-Based Planning , 1997, ECP.

[39]  Norman Sadeh,et al.  MICRO-OPPORTUNISTIC SCHEDULING THE MICRO-BOSS FACTORY SCHEDULER , 1994 .

[40]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach , 1999 .

[41]  Robert H. Storer,et al.  A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness , 1999, Oper. Res..

[42]  J. Christopher Beck,et al.  A General Framework for Scheduling in a Stochastic Environment , 2007, IJCAI.

[43]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[44]  P. Baptiste,et al.  Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling , 1996 .