Max Energy Filtering Algorithm for Discrete Cumulative Resources
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
New filtering for the cumulative constraint in the context of non-overlapping rectangles
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Edge finding filtering algorithm for discrete cumulative resources in O(kn log n)
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A new o(n2log n) not-first/not-last pruning algorithm for cumulative resource constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Exponential propagation for set variables
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A resource cost aware cumulative
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Explaining the cumulative propagator
Constraints
Timetable edge finding filtering algorithm for discrete cumulative resources
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving production scheduling with earliness/tardiness penalties by constraint programming
Journal of Intelligent Manufacturing
A quadratic edge-finding filtering algorithm for cumulative resource constraints
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A branch-and-price algorithm for multi-mode resource leveling
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Not-First and not-last detection for cumulative scheduling in O(n3 log n)
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems
Journal of Mathematical Modelling and Algorithms
The multi-inter-distance constraint
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Strong polynomiality of resource constraint propagation
Discrete Optimization
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The introduction of edge-finding techniques was a significant development in constraint-based scheduling. Today, edge finders are still the state of the art in the disjunctive case and a technique of interest in cumulative scheduling. This paper reconsiders edge-finding algorithms for cumulative scheduling and shows that Nuijten's edge finder, and its derivatives, are incomplete because they use an invalid dominance rule. We then present a correct cumulative edge finder running in time O(n2k), where n is the number of tasks and k the number of different capacity requirements of the tasks. The new algorithm is organized in two phases and first uses dynamic programming to precompute the innermost maximization in the edge-finder specification. The paper also proposes the first extended edge-finding algorithms that run in time O(n2k), improving the running time of available algorithms. Finally, the paper discusses how to speed up the algorithm in practice and how the first phase can be used to improve algorithms based on energetic reasoning.