[ The ECLiPSe Libraries | Reference Manual | Alphabetic Index ]library(ic_edge_finder3)
Cubic edge-finder algorithm for disjunctive and
cumulative constraints for IC
Predicates
- cumulative(+StartTimes, +Durations, +Resources, ++ResourceLimit)
- Cumulative constraint on specified tasks.
- cumulative(+StartTimes, +Durations, +Resources, +Areas, ++ResourceLimit)
- Cumulative constraint on specified tasks.
- disjunctive(+StartTimes, +Durations)
- Constraint the tasks with specified start times and durations do not overlap in time.
- disjunctive_bools(?, ?, ?)
- No description available
Description
This library implements the cubic edge-finder algorithm for the
disjunctive and cumulative scheduling constraints for the IC solver.
It provides the strongest propagation of the three libraries for
cumulative constraints: ic_cumulative, ic_edge_finder and
ic_edge_finder3. It is also computationally the most expensive.
Note that the same predicates are implemented in both ic_edge_finder
and ic_edge_finder3 libraries.
About
- Author: Joachim Schimpf
- Copyright © Imperial College London and ICL
- Date: $Date: 2002/07/26 13:25:02 $
Generated from ic_edge_finder3.eci on Sat Aug 7 01:44:40 2004