|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.cp.solver.constraints.global.scheduling.disjunctive.AbstractDisjRules
choco.cp.solver.constraints.global.scheduling.disjunctive.DisjRules
public final class DisjRules
Field Summary | |
---|---|
protected IThetaTree |
disjTreeT
The data structure used for Not-First/Not Last, overload checking and detectable precedence rules. |
protected IThetaLambdaTree |
disjTreeTL
The data structure used for EdgeFinding rule. |
protected choco.cp.solver.constraints.global.scheduling.disjunctive.IBipartiteQueue<ITask> |
queue
|
protected choco.cp.solver.constraints.global.scheduling.disjunctive.IBipartiteQueue<IRTask> |
rqueue
|
Fields inherited from class choco.cp.solver.constraints.global.scheduling.disjunctive.AbstractDisjRules |
---|
makespan, rtasks, updateManager |
Constructor Summary | |
---|---|
DisjRules(IRTask[] rtasks,
IRMakespan makespan)
Instantiates a new disjunctive. |
Method Summary | |
---|---|
boolean |
detectablePrecedenceEST()
DetectablePrecedence rule. |
boolean |
detectablePrecedenceLCT()
symmetric DetectablePrecedence rule. |
boolean |
edgeFindingEST()
EdgeFinding rule. |
boolean |
edgeFindingLCT()
symmetric EdgeFinding rule. |
boolean |
isActive()
|
boolean |
notFirst()
|
boolean |
notLast()
NotLast rule. |
void |
overloadChecking()
Overload checking rule. |
void |
remove(IRTask rtask)
optional operation |
Methods inherited from class choco.cp.solver.constraints.global.scheduling.disjunctive.AbstractDisjRules |
---|
detectablePrecedence, edgeFinding, fireDomainChanged, getTaskArray, initialize, notFirstNotLast, setMakespanLB, setupMasterTree, sortQueue, sortRTasks |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
protected final choco.cp.solver.constraints.global.scheduling.disjunctive.IBipartiteQueue<IRTask> rqueue
protected final choco.cp.solver.constraints.global.scheduling.disjunctive.IBipartiteQueue<ITask> queue
protected final IThetaTree disjTreeT
protected final IThetaLambdaTree disjTreeTL
Constructor Detail |
---|
public DisjRules(IRTask[] rtasks, IRMakespan makespan)
tasks
- the vars the tasks involved in the constraintconstraint
- their processing timesMethod Detail |
---|
public final boolean isActive()
public void remove(IRTask rtask)
IDisjRules
public void overloadChecking() throws ContradictionException
ContradictionException
public boolean notFirst() throws ContradictionException
ContradictionException
public boolean notLast() throws ContradictionException
ContradictionException
public boolean detectablePrecedenceEST() throws ContradictionException
ContradictionException
public boolean detectablePrecedenceLCT() throws ContradictionException
ContradictionException
public boolean edgeFindingEST() throws ContradictionException
ContradictionException
public boolean edgeFindingLCT() throws ContradictionException
ContradictionException
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |