IBM ILOG Scheduler User's Manual > Getting Started with Scheduler > Using the Building Blocks > Adding Resources and Resource Constraints > Solve the Problem |
Solve the Problem |
INDEX
![]() |
The previous problem was constrained only by regular temporal constraints and thus could be solved directly by propagation. In this slightly more complicated version, constraint propagation alone is not sufficient to solve the problem because of the constraints on the unary resource. IloRankForward
returns a goal used to rank all the resource constraints on the resource worker
, while minimizing the criterion makespan
. (For more information on ranking, see Ranking Goals or the ILOG Scheduler Reference Manual.)
© Copyright IBM Corp. 1987, 2009. Legal terms. | PREVIOUS NEXT |