Computational geometry: an introduction
Computational geometry: an introduction
Constraint-Based Scheduling
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A New Multi-resource cumulatives Constraint with Negative Heights
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Efficient Edge-Finding on Unary Resources with Optional Activities
Applications of Declarative Programming and Knowledge Management
Constraint-based modeling and scheduling of clinical pathways
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
O(n log n) overload checking for the cumulative constraint and its application
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
| Hi-index | 0.00 |
Alternative resource constraint problems have to be solved in practical applications where several resources are available for the activities to be scheduled. In this paper, we present a modular approach to solve such problems which is based on single resource constraints. Furthermore, we present a new sweeping algorithm which performs some “global” overload checking for the alternative resource constraint problem. To our knowledge, this is the first presentation where “sweeping”, a well-known technique in computational geometry, was used to perform this checking efficiently. For a practical evaluation of our approach, we implemented and integrated it into our Java constraint engine firstcs. We compared our implementation with the more general disjoint2 constraint in SICStus Prolog on some benchmark problems: the publicly available random placement problems (RPP).