From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling

AI Communications

Volumn 20, Issue 3, 2007, Pages 163-180

  Policella, Nicola ^a   Cesta, Amedeo ^a   Oddi, Angelo ^a   Smith, Stephen F ^b  

^a CNR   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Constraint programming; Robustness; Scheduling

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

LEAST COMMITMENT APPROACH; POST-PROCESSING PHASE; PRECEDENCE CONSTRAINT POSTING (PCP); TEMPORAL UNCERTAINTY;

SCHEDULING;

EID: 34848844128     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. M.A. Aloulou and M.C. Portmann, An efficient proactivereactive scheduling approach to hedge against shop floor disturbances, in: Multidisciplinary Scheduling: Theory and Applications, G. Kendall, E. Burke, S. Petrovic and M. Gendreau, eds, Springer, 2005, pp. 223-246.
2. P. Baptiste and C. Le Pape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, in: Proceedings of the 14th International, Joint Conference on Artificial Intelligence, IJCAI-95, Morgan Kaufmann, 1995, pp. 600-606.
3. P. Baptiste, C. Le Pape and W. Nuijten, Constraint-Based Scheduling, International Series in Operations Research and Management Science, Vol. 39, Kluwer Academic Publishers, 2001.
4. M. Bartusch, R.H. Mohring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research 16 (1988), 201-240.
5. J.C. Beck, E.D. Davenport, A.J. Davis and M.S. Fox, The ODO project: Towards a unified basis for constraint-directed scheduling, Journal of Scheduling 1 (1998), 89-125.
6. A. Cesta, A. Oddi and S.F. Smith, Profile based algorithms to solve multiple capacitated metric scheduling problems, in: Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS-98, AAAI Press, 1998, pp. 214-223.
7. A. Cesta, A. Oddi and S.F. Smith, An iterative sampling procedure for resource constrained project scheduling with time windows, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI-99, Morgan Kaufmann, 1999, pp. 1022-1029.
8. A. Cesta, A. Oddi and S.F. Smith, A constraint-based method for project scheduling with time windows, Journal of Heuristics 8(1) (2002), 109-136.
9. A. Cesta and C. Stella, A time and resource problem for planning architectures, in: Proceedings of the 4th Eumpean Confermce on Planning, ECP-97, Lecture Notes in Computer Science, Vol. 1348, S. Steel and R. Alami, eds, Springer, 1997, pp. 117-129.
10. C. Cheng and S.F. Smith, Generating feasible schedules under complex metric constraints, in: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI-94, AAAI Press, 1994, pp. 1086-1091.
11. A.J. Davenport, C. Gefflot and J.C. Beck, Slack-based techniques for robust schedules, in: Proceedings of 6th European Conference on Planning, ECP-01, 2001.
12. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence 49 (1991), 61-95.
13. R. Dechter and F. Rossi, Constraint satisfaction, in: Encyclopedia of Cognitive Science, L. Nadel, ed., Nature Publishing Group, 2002.
14. B. Drabble and A. Tate, The use of optimistic and pessimistic resource profiles to inform search in an. activity based planner, in: Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, AIPS-94, AAAI Press, 1994, pp. 243-248.
15. M. Drammond, J. Bresina and K. Swanson, Just-in-case scheduling, in: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI-94, AAAI Press, 1994, pp. 1098-1104.
16. H.H. El Sakkout and M.G. Wallace, Probe backtrack search for minimal perturbation in dynamic scheduling, Constraints 5(4) (2000), 359-388.
17. M.S. Fox, Constraint guided scheduling: A short history of scheduling research at CMU, Computers and Industry 14(1-3) (1990), 79-88.
18. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
19. D. Godard, P. Laborie and W. Nuitjen, Randomized large neighborhood search for cumulative scheduling, in: Proceedings of the 15th International Conference on Automated Planning & Scheduling, ICAPS'05, AAAI Press, 2005, pp. 81-89.
20. R. Kolisch, C. Schwindt and A. Sprecher, Benchmark instances for project scheduling problems, in: Project Scheduling - Recent Models, Algorithms and Applications, J. Weglarz, ed., Kluwer Academic Publishers, Boston, 1998, pp. 197-212.
21. V. Kumar, Algorithms for constraint-satisfaction problems: A survey, Artificial Intelligence Magazine 13(1) (1992), 32-44.
22. P. Laborie, Algorithms for propagating resource constraints in A.I. planning and scheduling: Existing approaches and new results, Artificial Intelligence 143(2) (2003), 151-188.
23. P. Laborie and M. Ghallab, Planning with sharable resource constraints, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI-95, Morgan Kaufmann, 1995, pp. 1643-1651.
24. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences 7 (1974), 95-132.
25. N. Muscettola, Computing the envelope for stepwise-constant resource allocations, in: Principles and Practice of Constraint Programming, 8th International Conference, CP 2002, Lecture Notes in Computer Science, Vol. 2470, Springer, 2002, pp. 139-154.
26. W. Nuijten and C. Le Pape, Constraint-based job shop scheduling with ilog-scheduler, Journal of Heuristics 3(4) (1998), 271-286.
27. W.P.M. Nuijten and E.H.L. Aarts, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, European Journal of Operational Research 90(2) (1996), 269-284.
28. N. Policella, A. Oddi, S.F. Smith and A.Cesta, Generating robust partial order schedules, in: Principles and Practice of Constraint Programming, 10th International Conference, CP 2004, Lecture Notes in Computer Science, Vol. 3258, M. Wallace, ed., Springer, 2004, pp. 496-511.
29. N. Policella, S.F. Smith, A. Cesta and A. Oddi, Generating robust schedules through temporal flexibility, in: Proceedings of the 14th International Conference on Automated Planning & Scheduling, ICAPS'04, AAAI Press, 2004, pp. 209-218.
30. N. Policella, Scheduling with, uncertainty: A proactive approach using partial order schedules, PhD thesis, Department of Computer and Systems Science, University of Rome "La Sapienza", March 2005.
31. B. Roy and B. Sussman, Les problemes d'ordonnancement avec contraintes disjonctives, Note DS n. 9 bis, SEMA, Paris, 1964.
32. N.M. Sadeh, Look-ahead techniques for micro-opportunistic job shop scheduling, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, March 1991.
33. S.F. Smith, OPIS: A methodology and architecture for reactive scheduling, in: Intelligent Scheduling, M. Fox and M. Zweben, eds, Morgan Kaufmann, 1994, pp. 29-66.
34. S.F. Smith and C. Cheng, Slack-based heuristics for constraint satisfactions scheduling, in: Proceedings of the 11th National Conference on Artificial Intelligence, AAAI-93, AAAI Press, 1993, pp. 139-144.
35. E.P.K. Tsang, Foundations of Constraint Satisfaction, Academic Press, London and San Diego, 1993.