New filtering for the cumulative constraint in the context of non-overlapping rectangles

Annals of Operations Research

Volumn 184, Issue 1, 2011, Pages 27-50

  Beldiceanu, Nicolas ^a   Carlsson, Mats ^b   Demassey, Sophie ^a   Poder, Emmanuel ^a  

^a ECOLE DES MINES DE NANTES   (France)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85027935836     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-010-0731-0     Document Type: Article

References (17)

1. Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57-73.
2. Baptiste, P., & Le Pape, C. (1999). Constraint propagation techniques for cumulative scheduling. In Proceedings of the first workshop on the integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Ferrara, Italy, 1999.
3. Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97-123.
4. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., & Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In C. Bessière (Ed.), LNCS: Vol. 4741. Proc. CP'2007 (pp. 180-194). Berlin: Springer.
5. Biró, M. (1990). Object-oriented interaction in resource constrained scheduling. Information Processing Letters, 36(2), 65-67.
6. Bouwkamp, C. J., & Duijvestijn, A. J. W. (1992). Catalogue of simple perfect squared squares of orders 21 through 25. Technical report EUT Report 92-WSK-03, Eindhoven University of Technology, The Netherlands, November 1992.
7. Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In Joint international conference and symposium on logic programming (JICSLP'96). Cambridge: MIT Press.
8. Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183(3), 1196-1211.
9. Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers and Operation Research, 35(3), 944-959.
10. Erschler, J., & Lopez, P. (1990). Energy-based approach for task scheduling under time and resources constraints. In 2nd international workshop on project management and scheduling (pp. 115-121). Compiégne, France, June 1990.
11. Garey, M. R., & Johnson, D. S. (1979). Computers and intractibility. A guide to the theory of NP-completeness. New York: Freeman.
12. Lahrichi, A. (1982). Scheduling: the notions of hump, compulsory parts and their use in cumulative problems. Comptes Rendus de l'Académie Des Sciences, Paris, 294, 209-211.
13. Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2004). Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters, 90(1), 7-14.
14. Mercier, L., & van Hentenryck, P. (2008). Edge-finding for cumulative scheduling. INFORMS Journal on Computing, 20(1), 143-153.
15. Simonis, H., & O'Sullivan, B. (2008). Search strategies for rectangle packing. In P. J. Stuckey (Ed.), LNCS: Vol. 5202. Proc. CP'2008 (pp. 52-66). Berlin: Springer.
16. Trick, M. A. (2003). A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of Operations Research, 118(1-4), 73-84.
17. van Hentenryck, P. (1994). Scheduling and packing in the constraint language cc(FD). In M. Zweben & M. Fox (Eds.), Intelligent scheduling. San Mateo: Morgan Kaufmann.