A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A quadratic propagator for the inter-distance constraint
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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 |
We study the "inter-distance constraint," also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal to a given value. When this value is 1, the inter-distance constraint reduces to the all-different constraint. We introduce an algorithm to propagate this constraint and we show that, when variables domains are intervals, our algorithm achieves arc-B-consistency. It provides tighter bounds than generic scheduling constraint propagation algorithms (like edge-finding) that could be used to capture this constraint. The worst case complexity of the algorithm is cubic but it behaves well in practice and it drastically reduces the search space. Experiments on special Job-Shop problems and on an Air-Traffic problem known as the "Runway Sequencing" problem.