Computational geometry: an introduction
Computational geometry: an introduction
A CLP language handling disjunctions of linear constraints
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Improved CLP scheduling with task intervals
Proceedings of the eleventh international conference on Logic programming
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
Constraint-Based Scheduling
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Selected Papers from Constraint Programming: Basics and Trends
Modelling Producer/Consumer Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
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
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Dynamic Constraint Models for Planning and Scheduling Problems
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Oz Scheduler: A Workbench for Scheduling Problems
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Models for Global Constraint Applications
Constraints
Modeling adversary scheduling with QCSP+
Proceedings of the 2008 ACM symposium on Applied computing
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Towards a time-triggered schedule calculation tool to support model-based embedded software design
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Global propagation of practicability constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A resource cost aware cumulative
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
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
Filtering algorithms for discrete cumulative problems with overloads of resource
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Realising the alternative resources constraint
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Better propagation for non-preemptive single-resource constraint problems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
A scalable sweep algorithm for the cumulative constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
This paper presents a newcumulatives constraint, which generalizes the original cumulative constraint in different ways. The two most important aspects consist in permitting multiple cumulative resources as well as negative heights for the resource consumption of the tasks. This allows modeling in an easy way workload covering, producer-consumer, and scheduling problems. The introduction of negative heights has forced us to come up with new filtering algorithms and to revisit existing ones. The first filtering algorithm is derived from an idea called sweep, which is extensively used in computational geometry; the second algorithm is based on a combination of sweep and constructive disjunction; while the last is a generalization of task intervals to this new context. A real-life crew scheduling problem originally motivated this constraint which was implemented within the SICStus finite domain solver and evaluated against different problem patterns.