Module org.maxicp
Package org.maxicp.cp.engine.constraints.scheduling
package org.maxicp.cp.engine.constraints.scheduling
Constraints implementation for Scheduling over Interval Variables and Cumulative Functions
-
ClassDescriptionRepresents a scheduling activity i.e. an interval variable that consumes an ammount of resource over time.Alternative Constraint with cardinality: Enforces that if the interval a is present, then c intervals from the array alt must be present and synchronized with a.CP implementation of a Cumulative FunctionCP implementation of a Flat Cumulative FunctionCP implementation of a Minus Cumulative FunctionCP implementation of a Plus Cumulative FunctionCP implementation of a Pulse Cumulative FunctionCP implementation of a Step at End Cumulative FunctionCP implementation of a Step at Start Cumulative FunctionCP implementation of a Sum Cumulative FunctionCumulative constraint with sum decomposition (very slow).Enforces that interval A ends at interval B end if B is present and that interval B ends at interval A end if A is presentEnforces that interval A ends at interval B start if B is present and that interval B starts at interval A end if A is presentConstrains interval A to end before or at the end of interval B.Constrains interval A to end before or at the start of interval B if both are present.Checker for the generalized cumulative constraint.Generalized Cumulative Constraint using Timetabling TODO Refer paper once publishedGeneralized Cumulative Constraint using Timetabling TODO Refer paper once publishedTODOTODOTODOTODOTODOTODOReified is end before start constraintReified is end before start constraintReified is end before start constraintReified is start before start constraintNoOverlap constraint, ensures that a set of interval variables do not overlap in time.Bound Consistency filtering for the NoOverlap constraintBound Consistency filtering for the NoOverlap constraintRepresentation of a cumulated Profile data structure as a contiguous sequence of
Profile.Rectanglebuilt from a set ofProfile.Rectangleusing a sweep-line algorithm.Represents a rectangle which is part of theProfiledatastructureEnforces that interval A starts at interval B end if B is present and that interval B ends at interval A start if A is presentEnforces that interval A starts at interval B start if B is present and that interval B starts at interval A start if A is presentConstrains interval A to start before or at the end of interval B if both are present.Constrains interval A to start before or at the start of interval B.Data Structure described in Global Constraints in Scheduling, 2008 Petr Vilim, PhD thesis See The thesis.Data Structure described in Global Constraints in Scheduling, 2008 Petr Vilim, PhD thesis See The thesis.