A Reactive Scheduling Agent
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Planning, Scheduling, Reasoning About Actions. Pages 1004-1008.
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.
@inproceedings{ijcai1989p161,
title = {A Reactive Scheduling Agent},
author = {Prosser, Patrick},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {1004--1008},
year = {1989},
month = {8},
note = {Planning, Scheduling, Reasoning About Actions},
url = {https://ijcai.org/proceedings/1989/161},
}
TY - CPAPER TI - A Reactive Scheduling Agent AU - Prosser, Patrick T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 1004 EP - 1008 UR - https://ijcai.org/proceedings/1989/161 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
