Abstract
This paper introduces an innovative approach to the problem of rescheduling within manufacturing industry. An example of a manufacturing context that requires rescheduling capability is given (tyre production). The meaning of rescheduling, possible metrics for assessment of rescheduling and the advantages of applying the new techniques are reviewed. Of particular importance is the notion that the technology for providing rescheduling and explanation capabilities is to a large degree problem and context insensitive. The manner in which an original schedule has been created is irrelevant to the use of the technology described, allowing the advantages of the approach to be realized as an add-on facility to any existing scheduling system that fulfills a minimal set of requirements. These advantages are due to the use of a constraint based approach to new schedule creation used in tandem with dependency analysis techniques based on reason maintenance systems (de Kleer, 1986) and partial order backtracking (Ginsberg and McAllister, 1995; Spragg and Kelleher, 1996).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arshad, F. N., El-Rhalibi, A. and Kelleher, G. (1999a) Pipeline Intermodal System to Support Control Expedition and Scheduling, WESIC99, Newport, Wales, UK, eds. G. Roberts et al.
Arshad, F. N., El-Rhalibi, A. and Kelleher, G. (1999) CSP and GA for Supporting Intermodal Transport Planning, Expert Systems'99, eds. R. Milne et al.
Ayesh, A. and Kelleher, G. (1998) Aspects of temporal useability via constraint-based reasoning: The use of constraints as a debugging tool, Proceedings IASTED International Conference on Artificial Intelligence and Soft Computing, Cancun, Mexico.
Basaglia, G. and Guida, M. (1991) Operational research and artificial intelligence in the development of real-time scheduling systems, the BIS project, in IJCAI'91 Workshop in Advances in Interfacing Production Systems with the Real World, Sydney, Australia.
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-TR-95-03.
de Kleer, J. (1986) An assumption-based RMS. Artificial Intelligence, 28(2), 127-162.
de Kleer, J. (1993) A perspective on assumption-based truth maintenance. Artificial Intelligence, 59(1–2), 63-67.
Ginsberg, M. L. (1993) Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
Ginsberg, M. L. and McAllester, D. A. (1994) GSAT and dynamic backtracking, Knowledge Representation and Reasoning Conference (KR94).
Hasle, G., Kelleher, G. and Spragg, J. E. (1995) Encoding the Pirelli tyre scheduling problem as a CSP, IJCAI-95 Workshop on Intelligent Manufacturing Systems.
Kelleher, G. and van Der Gaag, L. (1993) The LazyRMS: Avoiding work in the ATMS. Computational Intelligence, 9(3).
Kelleher, G. and Smith, B. M. (1988). An introduction to reason maintenance systems, in Reason Maintenance Systems and their Application, eds. Smith, B. M. and Kelleher, G. Ellis Horwood.
Mott, D., Cunningham, J., Kelleher, G. and Gadsden, J. (1988) Constraint-based reasoning for generation of naval flying programmes. International Journal of Expert Systems.
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. AAAI.
Prosser, P. (1993) Scheduling as a constraint satisfaction problem: Theory and practice, in Scheduling of Production Processes, eds. Dorn and Froeschi. Ellis Horwood.
Reyes, A., Yu, H. and Kelleher, G. (2000a) Advanced scheduling methodologies for flexible manufacturing systems using Petri Nets and Heuristic Search, IEEE International Conference on Robotics and Automation, ICRA 2000.
Reyes, A., Yu, H. and Kelleher, G. (2000b) A PN reachability graph branching scheme with application to the scheduling of flexible manufacturing systems, IFAC International Conference on Control Systems Design, 2000.
Reyes, A., Yu, H. and kelleher, G. (2000c) Petri Net based scheduling of flexible manufacturing systems using hybrid heuristic search, UKACC International Conference, Control 2000.
Reyes, A., Yu, H. and Kelleher, G. (1999) Petri Nets, heuristic search and natural evolution: A promising scheduling algorithm for job shop systems, Proceedings of the 3rd International Symposia on Intelligent Industrial Automation.
Smith, S. F. (1995) Reactive Scheduling Systems. Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213.
Spragg, J. E. and Kelleher, G. (1996) A discipline for reactive rescheduling, AI in Planning and Scheduling, AIPS96, ed. Austin Tate, AAAI Press.
Tatar, M. M. (1994) Combining lazy evaluation with focusing techniques in an ATMS, Proceedings European Conference on Artificial Intelligence (EC AI94).
Yu, H., Kelleher, G. and Ayesh, A. (1998a) A Petri Net based planning method, Proceedings IASTED Intelligent Systems and Control Conference, Halifax, Canada.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kelleher, G., Cavichiollo, P. Supporting rescheduling using CSP, RMS and POB—an example application. Journal of Intelligent Manufacturing 12, 343–357 (2001). https://doi.org/10.1023/A:1011267400804
Issue Date:
DOI: https://doi.org/10.1023/A:1011267400804