New filtering for the \it cumulative constraint in the context of non-overlapping rectangles
Résumé
This article describes new filtering methods for the cumulative constraint. The first method introduces the so called longest closed hole and longest open hole problems. For these two problems it first provides bounds and exact methods and then shows how to use them in the context of the non-overlapping constraint. The second method introduces balancing knapsack constraints which relate the total height of the tasks that end at a specific time-point with the total height of the tasks that start at the same time-point. Experiments on tight rectangle packing problems show that these methods drastically reduce both the time and the number of backtracks for finding all solutions as well as for finding the first solution. For example, we found without backtracking all solutions to 65 perfect square instances of order 22-25 and sizes ranging from 192×192 to 661×661.