Incrementally scheduling with qualitative temporal information

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Launay, F., & Mitra, D. (2005). Incrementally scheduling with qualitative temporal information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 229–231). Springer Verlag. https://doi.org/10.1007/11504894_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free