Abstract
Scheduling is typically a quantitative engineering problem involving tasks and constraints. However, there are many real life situations where the input is qualitative in nature and any quantitative information is neither available nor cared for. We address here such a qualitative scheduling problem with disjunctive temporal constraints between the tasks. The problem we address is incremental in nature, where a new task is added to a committed schedule. We not only find a valid schedule when it exists, but also analyze the causes of inconsistency otherwise. This is new direction of research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Ligozat, G.: A new proof of tractability for ORD-Horn relations. In: Proceedings of the 13th National (US) Conference on Artificial Intelligence (AAAI 1996), pp. 395–401. AAAI Press, Menlo Park (1996)
Mitra, D., Launay, F.: Problem of detecting the culprit conflicting constraints in temporal reasoning. In: Workshop on Spatial and Temporal Reasoning, San Jose, California. AAAI, Menlo Park (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Launay, F., Mitra, D. (2005). Incrementally Scheduling with Qualitative Temporal Information. In: Ali, M., Esposito, F. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2005. Lecture Notes in Computer Science(), vol 3533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11504894_32
Download citation
DOI: https://doi.org/10.1007/11504894_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26551-1
Online ISBN: 978-3-540-31893-4
eBook Packages: Computer ScienceComputer Science (R0)