Modifier and Type | Method and Description |
---|---|
default void |
binPackingDec(IntVar[] bin,
int[] w,
IntVar[] load,
int offset)
Creates and posts a decomposition of a bin packing constraint.
|
default void |
cumulativeTimeDec(IntVar[] starts,
int[] durations,
int[] heights,
int capacity)
Creates and posts a decomposition of a cumulative constraint: associates a boolean
variable to each task and each point of time sich that the scalar product of boolean
variables per heights for each time never exceed capacity.
|
default IntVar[] |
regularDec(IntVar[] vars,
IAutomaton automaton)
Creates and posts a decomposition of a regular constraint.
|
default void cumulativeTimeDec(IntVar[] starts, int[] durations, int[] heights, int capacity)
starts
- starting time of each taskdurations
- processing time of each taskheights
- resource consumption of each taskcapacity
- resource capacityIIntConstraintFactory.cumulative(IntVar[], int[],
int[], int)
default IntVar[] regularDec(IntVar[] vars, IAutomaton automaton)
vars
- sequence of variablesautomaton
- a deterministic finite automaton defining the regular languagedefault void binPackingDec(IntVar[] bin, int[] w, IntVar[] load, int offset)
bin
- IntVar representing the bin of each itemw
- int representing the size of each itemload
- IntVar representing the load of each bin (i.e. the sum of the size of the items
in it)offset
- 0 by default but typically 1 if used within MiniZinc (which counts from 1 to n
instead of from 0 to n-1)Copyright © 2018. All rights reserved.