Abstract
For all 8192 combinations of Allen’s 13 relations between one task with origin oi and fixed length ℓi and another task with origin oj and fixed length ℓj, this paper shows how to systematically derive a formula F (oj, oj, ℓi, ℓj), where oj and oj respectively denote the earliest and the latest origin of task j, evaluating to a set of integers which are infeasible for oi for the given combination. Such forbidden regions allow maintaining range-consistency for an Allen constraint.
Original language | English |
---|---|
Title of host publication | Integration of AI and OR Techniques in Constraint Programming |
Subtitle of host publication | 14th International Conference, CPAIOR 2017 Padua, Italy, June 5–8, 2017 Proceedings |
Editors | Domenico Salvagnin, Michele Lombardi |
Place of Publication | Cham Switzerland |
Publisher | Springer |
Pages | 21-29 |
Number of pages | 9 |
ISBN (Electronic) | 9783319597768 |
ISBN (Print) | 9783319597751 |
DOIs | |
Publication status | Published - 2017 |
Externally published | Yes |
Event | International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2017 - Padova, Italy Duration: 5 Jun 2017 → 8 Jun 2017 Conference number: 14th https://cpaior2017.dei.unipd.it/ (Conference website) https://link.springer.com/book/10.1007/978-3-319-59776-8 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 10335 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2017 |
---|---|
Abbreviated title | CPAIOR 2017 |
Country | Italy |
City | Padova |
Period | 5/06/17 → 8/06/17 |
Internet address |
|