A quadratic propagator for the inter-distance constraint

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 123-128

  Quimper, Claude Guy ^a   López Ortiz, Alejandro ^a   Pesant, Gilles ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOUND CONSISTENCY; QUADRATIC PROPAGATOR; SCHEDULING PROBLEMS; TIME COMPLEXITY;

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SCHEDULING;

CONSTRAINT THEORY;

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

References (11)

1. Artiouchine, K., and Baptiste, P. 2005. Inter-distance constraint: An extension of the all-different constraint for scheduling equal length jobs. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, pp. 62-76.
2. Artiouchine, K.; Baptiste, P.; and Dürr, C. 2004. Runway scheduling with holding loop. In Proceedings of Second International Workshop on Discrete Optimization Methods in Production and Logistics, pp. 96-101.
3. Carlier, J., and Pinson, E. 1994. Adjustment of heads and tails for the job-shop problem. European Journal of Operation Rsearch 78:146-161.
4. Garey, M.; Johnson, D.; Simons, B.; and Tarjan, R. 1981. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing 10(2):256-269.
5. ILOG. 1998. ILOG Solver 4.2 user's manual.
6. López-Ortiz, A.; Quimper, C.-G.; Tromp, J.; ; and van Beek, P. 2003. A fast and simple algorithm for bounds consistency of the alldifferent constraint. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 245-250.
7. Mehlhorn, K., and Thiel, S. 2000. Faster algorithms for bound-consistency of the sortedness and alldifferent constraint. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pp. 306-319.
8. Mercier, L., and Van Hentenryck, P. 2005. Edge finding for cumulative scheduling. Submitted for publication.
9. Fuget, J.-F. 1998. A fast algorithm for the bound consistency of alldiff constraints. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 359-366.
10. Régin, J.-C. 1994. A filtering algorithm for constraints of difference in CSPs. Proceedings of AAAI-94 pp. 362-367.
11. Régin, J.-C. 1997. The global minimum distance constraint. Technical report, ILOG.