A New multi-resource cumulatives constraint with negative heights

Beldiceanu, Nicolas (författare)

(creator_code:org_t)

1
2002-09-02
2002
Engelska.
Ingår i: CP'2002, Principles and Practice of Constraint Programming. - Berlin, Heidelberg : Springer-Verlag. ; , s. 63-79

Relaterad länk:: http://www.springerl...; visa fler...; http://ri.diva-porta...; https://urn.kb.se/re...; https://doi.org/10.1...; visa färre...

Abstract Ämnesord

Stäng

This paper presents a new cumulatives 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.

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.