IBM ILOG Scheduler User's Manual > Advanced Concepts > Scheduling with Discrete Resources: the Ship-loading Problem, Second Version > Decomposing the Problem |
Decomposing the Problem |
INDEX
![]() |
As we consider how to represent this problem, we need to tackle two issues. First, can we identify the critical activities that play a pivotal role in the problem, so that we can decompose the problem by breaking it down around those activities? The answer to that question is "yes" and there is even a formal mathematical technique for identifying those activities and a functionality of Scheduler (precedence graphs) that implements it.
© Copyright IBM Corp. 1987, 2009. Legal terms. | PREVIOUS NEXT |