Reasoning with conditional time-intervals

Proceedings of the 21th International Florida Artificial Intelligence Research Society Conference, FLAIRS-21

Volumn , Issue , 2008, Pages 555-560

  Laborie, Philippe ^a   Rogerie, Jérôme ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CONSTRAINT PROPAGATIONS; EFFICIENT SEARCHES; GLOBAL CONSTRAINTS; INTEGER VARIABLES; INTERVAL VARIABLES; MODELLING PROCESSES; NEW GENERATIONS; OPTIMIZER; SCHEDULING APPLICATIONS; SCHEDULING MODELS;

SCHEDULING;

EID: 55849131010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Barták, R., and Čepek, O. 2007. Temporal networks with alternatives: Complexity and model. In Proc. FLAIRS-2007.
2. Beck, J. C., and Fox, M. S. 1999. Scheduling alternative activities. In Proc. AAAI-99.
3. Bessière, C., and Régin, J.-C. 1997. Arc consistency for general constraint networks: preliminary results. In Proc. IJCAI'97, 398-404.
4. Brafman, R. I. 2001. A simplifier for prepositional formulas with many binary clauses. In Proc. IJCAI-01, 515-522.
5. Cesta, A., and Oddi, A. 1996. Gaining efficiency and flexibility in the simple temporal problem. In Proc. TIME-96.
6. Cherkassky, B.; Goldberg, A.; and Radzic, T. 1996. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73:129-174.
7. ILOG. 1997. ILOG Scheduler 4.0 Reference Manual. ILOG. 2008. ILOG CP Optimizer. Webpage: http://www.ilog.com/products/cpoptimizer/.
8. Laborie, P., and Godard, D. 2007. Self-adapting large neighborhood search: Application to single-mode scheduling problems. In Proc. MISTA-07.
9. Moffitt, M. D.; Peintner, B.; and Pollack, M. E. 2005. Augmenting disjunctive temporal problems with finite-domain constraints. In Proc. AAAI-2005.
10. Nuijten, W.; Bousonville, T.; Focacci, F.; Godard, D.; and Le Pape, C. 2004. Towards an industrial manufacturing scheduling problem and test bed. In Proc. PMS-2004, 162-165.
11. Vidal, V., and Geffner, H. 2006. Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. Artificial Intelligence 170:298-335.
12. Vilím, P.; Barták, R.; and Čepek, O. 2005. Extension of o(n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10:403-425.