A Discipline for Reactive Rescheduling

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages 199-204

  Spragg, J E ^a   Kelleher, Gerry ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b LIVERPOOL JOHN MOORES UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; JOB SHOP SCHEDULING;

JOB-SHOP; MULTI-DOMAINS; PARTIAL ORDER;

REPAIR;

EID: 1842701788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Cheng-Chung, C., and Smith, S.F. 1995. Applying Constraint Satisfaction Techniques to Job-Shop Scheduling The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213, CMU-RI-TR9-95-03.
2. Ginsberg, M.L. 1993. Dynamic Backtracking Journal of Artificial Intelligence Research 1, 25-46.
3. Ginsberg, M.L., and McAllester, D.A. 1994. GSAT and Dynamic Backtracking Knowledge Representation and Reasoning Conference..
4. Hasle, G., Kelleher, G., and Spragg, J.E. 1995. Encoding the Pirelli Tyre Scheduling Problem as a CSP Paper accepted for IJCAI-95 Workshop on Intelligent Manufacturing Systems.
5. Kelleher, G. and Spragg, J.E., 1996. Add-On Rescheduling: Rescheduling with Arbitrary Scheduling Systems John Moores University, School of Computing and Mathematical Sciences. Report CMS 14.
6. Kelleher, G., and Van Der Gaag, L. 1993. The Lazy RMS: Avoiding Work in the ATMS Computational Intelligence. Vol. 9, Number 3.
7. Minton, S., and Johnston, M.D., Philips, A. B., and Laird, P. 1990. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 17-24.
8. Prosser, P. 1993. Scheduling as a Constraint Satisfaction Problem: Theory and Practice In Scheduling of Production Processes edited by Dorn and Froeschi, Ellis Horwood.
9. Selman, B., Levesque, H., and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440-446.
10. Smith, S.F. 1995. Reactive Scheduling Systems. Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213
11. Spragg, J.E., and Kelleher, G. 1995. Context Shifting with Constraint Satisfaction Problems: Dynamic Backtracking with Forward Checking John Moores University. School of Computing and Mathematical Sciences, Report CMS 8.
12. Tatar, M.M. 1994. Combining Lazy Evaluation with Focusing Techniques in an ATMS Proceedings ECAI94.
13. Wiig, O.H. 1995. Constraint Reasoning and Dynamic Scheduling SINTEF Report STF33 A95001.