Proceedings

A Reactive Scheduling Agent

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Planning, Scheduling, Reasoning About Actions. Pages 1004-1008.

© 1989 International Joint Conferences on Artificial Intelligence

Abstract

Factory scheduling can be considered as an instance of the constraint satisfaction problem (CSP). Factory scheduling differs from traditional forms of the CSP in that it is a dynamic or open problem. Constraints are added to and retracted from the problem as work progresses on the shop floor. Constraints alter as unexpected events occur, such as the breakdown of machines, the late arrival of work, the early arrival of work and the changing demands put upon the scheduling system by the user. A system is required that can generate and maintain a schedule in near-real time and exploit opportunities as they arise. A single resource scheduling agent has been developed to schedule incrementally and reactively in a dynamic environment using advanced CSP techniques.

  1. [Buchanan et al., 1988] lain Buchanan, Peter Burke, John Costello and Patrick Prosser. "A Distributed Asynchronous Scheduler", Technical Report AISL36, Department of Computer Science, University of Strathclyde [Collinot et al, 1988]
  2. Anne Collinot, Claude le Pape and Gerard Pinoteau. "SONIA: A Knowledge-based Scheduling System", Artificial Intelligence in Engineering, vol 3, pp 86-94, 1988
  3. [Dechter, 1986] Rina Dechter. "Learning While Searching In Constraint Satisfaction Problems", AAAI-86, vol. 1, pp. 178-183, August 1986.
  4. [Elleby et al, 1987] Peter Elleby, Hugh Fargher and Tom Addis. "Incremental Constraint Satisfaction", Knowledge Systems Group, Department of Computer Science University of Reading, Whiteknights Park, Reading, Berkshire
  5. [Doyle, 1979] Jon Doyle. "A Truth Maintenance System", Readings in Artificial Intelligence, pp 495-516
  6. [Fox and Kempf, 1985] B.R.Fox and K.G. Kempf. "A Representation for Opportunistic Schedules", Robotics Research, The Third International Symposium, pp 109-115
  7. [Haralick and Elliot, 1980] Robert M Haralick and Gordon L Elliot. "Increasing Tree Search Efficiency for Constraint Satisfaction Problems", Artificial Intelligence, vol 14, pp. 263-314, 3/10/1980 IJCAI
  8. [Mackworth, 1977] Allan K Mackworth. "Consistency in Networks of Relations", Artificial Intelligence, vol. 8, pp. 99-118, 1977
  9. [Nudel, 1983] Bernard Nudel. "Consistent Labelling Problems and their Algorithms: Expected Complexities and Theory Based Heuristics", Artificial Intelligence, vol. 21, pp. 135-178, 1983
  10. [Ow et al., 1988] Peng Si Ow, Stephen F Smith and Alfred Thirez. "Reactive Plan Revision", Proceedings of the CAIA-88, pp 77-82, 1988
  11. [Smith et al.,1986] Stephen F Smith, Mark S. Fox, and Peng Si Ow. "Constructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems", AI Magazine, Fall 1986
  12. Prosser

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards