AIAI 2005: Artificial Intelligence Applications and Innovations pp 573-581 | Cite as
A Dynamic Constraint Solving Scheme for Semi On-Line Scheduling Problems
Abstract
Most of real-life scheduling problems are semi on-line scheduling, where we do not know all the time variables of jobs in advance. Recently, solving such dynamic problems is a hot topic of research in Constraint Programming. In this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint models. We designed a generic dynamic constraint solving algorithm for solving the scheduling problems. We give an example of its application to semi on-line discrete resource-constrained scheduling problem (ship-loading problem).
key words
Scheduling Semi On-line Constraint Solving MonotonicReferences
- [1]Wallace, M.: Applying Constraints for Scheduling, in Constraint Programming, Mayoh B. and Penjaak J. (eds. ), NATO ASI Series, Springer Verlag (1994)Google Scholar
- [2]Tsang, E. P. K.: Foundations of Constraint Satisfaction, San Diego, Calif.: Academic (1993) 53–63Google Scholar
- [3]Mittal, S., Falkemhainer, B.: Dynamic Constraint Satisfaction Problems, In Proceedings of AAAI-90 (1990) 25–32Google Scholar
- [4]Sgall J.: On-line scheduling. In: Fiat, A. and Woeginger, G. eds., On-line Algorithms: The State of Art, Lecture Notes in Computer Sciengces, 1442. Berlin: Springer-Verlag (1998)Google Scholar
- [5]Tsang, E. P. K, Foundations of Constraint Satisfaction. San Diego, Calif.: Academic (1993) 5–10Google Scholar
- [6]Juyang Zhang, Xin Li, Jigui Sun: Research On Constraint-based Scheduling and Its Implementation, Proceeding of CNCC’03, Beijing, The Tsinghua University Press (2003) 80–85Google Scholar