Data structures and network algorithms
Data structures and network algorithms
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
Artificial Intelligence - Special issue on knowledge representation
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Scheduling chains to minimize mean flow time
Information Processing Letters
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Network Flow Problems in Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Linear Weighted-Task-Sum --- Scheduling Prioritized Tasks on a Single Resource
Applications of Declarative Programming and Knowledge Management
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.02 |
This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = Σxi, and where variables xi are subject to difference constraints of the form xj - xi ≤ c. An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. Classical approaches perform a local consistency filtering after each reduction of the bound of y. The drawback of these approaches comes from the fact that the constraints are handled independently. We introduce here a global constraint that enables to tackle simultaneously the whole constraint system, and thus, yields a more effective pruning of the domains of the xi when the bounds of y are reduced. An efficient algorithm, derived from Dikjstra's shortest path algorithm, is introduced to achieve interval consistency on this global constraint.