DMCA
A New Multi-Resource cumulatives Constraint with Negative Heights (2001)
| Citations: | 30 - 3 self |
BibTeX
@MISC{Beldiceanu01anew,
author = {Nicolas Beldiceanu and Mats Carlsson},
title = {A New Multi-Resource cumulatives Constraint with Negative Heights},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a new s cumulative 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 new scheduling and planning problems. The introduction of negative heights has forced us to come up with new propagation algorithms and to revisit existing ones. The first propagation 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 timetabling problem originally motivated this constraint which was implemented within the SICStus finite domain solver and evaluated against different problem patterns.
Keyphrases
negative height new multi-resource cumulatives constraint computational geometry original cumulative constraint different way second algorithm different problem pattern planning problem new context multiple cumulative resource first propagation algorithm new cumulative constraint new propagation algorithm resource consumption real-life timetabling problem sicstus finite domain solver important aspect task interval easy way new scheduling constructive disjunction
