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

Related Packages

Package	Description
org.maxicp.cp.engine.constraints	Constraints implementation (propagators)
org.maxicp.cp.engine.constraints.seqvar	Constraints implementation for Sequence Variables
org.maxicp.cp.engine.constraints.setvar	Constraints implementation for Set Variables

Class	Description
Activity	Represents a scheduling activity, i.e., an interval variable that consumes an amount of resource over time.
Alternative	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.
CPCumulFunction	CP implementation of a Cumulative Function
CPFlatCumulFunction	CP implementation of a Flat Cumulative Function
CPMinusCumulFunction	CP implementation of a Minus Cumulative Function (left - right).
CPPlusCumulFunction	CP implementation of a Plus Cumulative Function (left + right).
CPPulseCumulFunction	CP implementation of a Pulse Cumulative Function
CPStepAtEndCumulFunction	CP implementation of a Step at End Cumulative Function
CPStepAtStartCumulFunction	CP implementation of a Step at Start Cumulative Function
CPSumCumulFunction	CP implementation of a Sum Cumulative Function.
CumulativeDecomposition	Cumulative constraint with sum decomposition (very slow).
EndAfter	Constraint enforcing that the end of an interval variable comes after or at a given integer variable: end(interval) >= var when interval is present.
EndAtEnd	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 present
EndAtStart	Enforces that interval A ends at interval B start if B is present and that interval B starts at interval A end if A is present
EndBefore	Constraint enforcing that the end of an interval variable comes before or at a given integer variable: end(interval) <= var when interval is present.
EndBeforeEnd	Constrains interval A to end before or at the end of interval B.
EndBeforeStart	Constrains interval A to end before or at the start of interval B if both are present.
GeneralizedCumulativeChecker	Checker for the generalized cumulative constraint.
GeneralizedCumulativeConstraint	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
GeneralizedCumulativeConstraint.eventType
GeneralizedCumulativeConstraintBaseLine	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
GeneralizedCumulativeConstraintBaseLine.eventType
GeneralizedCumulativeSweepMax	Sweep-line filtering algorithm for the Generalized Cumulative constraint enforcing a maximum capacity bound.
GeneralizedCumulativeSweepMax.Event
GeneralizedCumulativeSweepMax.EventType
GeneralizedCumulativeSweepMin	Sweep-line filtering algorithm for the Generalized Cumulative constraint enforcing a minimum capacity bound.
GeneralizedCumulativeSweepMin.Event
GeneralizedCumulativeSweepMin.EventType
IntervalVarEnd	Constraint linking the end time of an interval variable var to an integer variable end.
IntervalVarEndOrValue	Constraint linking the end time of an interval variable var to an integer variable end when var is present, or fixing end to a default value when var is absent.
IntervalVarLength	Constraint linking the length (duration) of an interval variable var to an integer variable length.
IntervalVarLengthOrValue	Constraint linking the length (duration) of an interval variable var to an integer variable length when var is present, or fixing length to a default value when var is absent.
IntervalVarStart	Constraint linking the start time of an interval variable var to an integer variable start.
IntervalVarStartOrValue	Constraint linking the start time of an interval variable var to an integer variable start when var is present, or fixing start to a default value when var is absent.
IsEndAfter	Reified constraint enforcing boolVar <=> end(intervalVar) >= var when intervalVar is present.
IsEndBefore	Reified constraint enforcing boolVar <=> end(intervalVar) <= var when intervalVar is present.
IsEndBeforeEnd	Reified is end before start constraint
IsEndBeforeStart	Reified is end before start constraint
IsEndBeforeStartWithTransition	Reified temporal ordering constraint with transition times.
IsStartBefore	Reified constraint enforcing boolVar <=> start(intervalVar) <= var when intervalVar is present.
IsStartBeforeEnd	Reified is end before start constraint
IsStartBeforeStart	Reified is start before start constraint
NoOverlap	NoOverlap constraint, ensures that a set of interval variables do not overlap in time.
NoOverlapBC	Bound Consistency filtering for the NoOverlap constraint
NoOverlapBCLeftToRight	Bound Consistency filtering for the NoOverlap constraint
NoOverlapBCLeftToRight.Outcome
NoOverlapBinary	Binary NoOverlap constraint enforcing that two interval variables A and B do not overlap in time when both are present.
NoOverlapBinaryWithTransitionTime	Binary NoOverlap constraint with transition times enforcing that two interval variables A and B do not overlap and respect minimum setup/transition times transitionTimeAB (when A precedes B) and transitionTimeBA (when B precedes A) when both are present.
NoOverlapLeftToRight	Left-to-right global filtering algorithms for the NoOverlap constraint (Overload Checking, Detectable Precedences, Not-Last, and Edge-Finding), based on Petr Vilim's PhD thesis (2008).
NoOverlapLeftToRight.Outcome
NoOverlapWithPosition	A global constraint that enforces a permutation (ordering) of interval variables with minimum transition times, using set-variable-based propagation for stronger filtering than the binary decomposition NoOverlapWithPositionDecomposition.
NoOverlapWithPositionDecomposition	A constraint that enforces a permutation (ordering) of interval variables, typically used for routing/scheduling problems such as TSP or job sequencing.
Profile	Representation of a cumulated Profile data structure as a contiguous sequence of Profile.Rectangle built from a set of Profile.Rectangle using a sweep-line algorithm.
Profile.Rectangle	Represents a rectangle which is part of the Profile datastructure
Span	Span Constraint: Enforces that if the interval span is present, then it begins with the first interval intervals from the array alt and ends with the latest.
StartAfter	Constraint enforcing that the start of an interval variable comes after or at a given integer variable: start(interval) >= var when interval is present.
StartAtEnd	Enforces that interval A starts at interval B end if B is present and that interval B ends at interval A start if A is present
StartAtStart	Enforces that interval A starts at interval B start if B is present and that interval B starts at interval A start if A is present
StartBefore	Constraint enforcing that the start of an interval variable comes before or at a given integer variable: start(interval) <= var when interval is present.
StartBeforeEnd	Constrains interval A to start before or at the end of interval B if both are present.
StartBeforeStart	Constrains interval A to start before or at the start of interval B.
ThetaLambdaTree	Data Structure described in Global Constraints in Scheduling, 2008 Petr Vilim, PhD thesis See The thesis.
ThetaTree	Data Structure described in Global Constraints in Scheduling, 2008 Petr Vilim, PhD thesis See The thesis.