A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the parametric complexity of schedules to minimize tardy tasks
Theoretical Computer Science - Australasian computer science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Edge Finding for Cumulative Scheduling
INFORMS Journal on Computing
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The parameterized complexity of global constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Precoloring extension on unit interval graphs
Discrete Applied Mathematics
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
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Parameterizing by the Number of Numbers
Theory of Computing Systems
Extending chip in order to solve complex scheduling and placement problems
Mathematical and Computer Modelling: An International Journal
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Kernels for global constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
Parameterized Complexity
Hi-index | 0.00 |
We investigate the computational complexity of two global constraints, CUMULATIVE and INTERDISTANCE. These are key constraints in modeling and solving scheduling problems. Enforcing domain consistency on both is NP-hard. However, restricted versions of these constraints are often sufficient in practice. Some examples include scheduling problems with a large number of similar tasks, or tasks sparsely distributed over time. Another example is runway sequencing problems in air-traffic control, where landing periods have a regular pattern. Such cases can be characterized in terms of structural restrictions on the constraints. We identify a number of such structural restrictions and investigate how they impact the computational complexity of propagating these global constraints. In particular, we prove that such restrictions often make propagation tractable.