The previous two chapters introduced the use of the neighborhood and metaheuristic objects provided in IBM® ILOG® Solver in the context of scheduling. In both of those examples there was a single type of decision to be made: the sequence of activities on each resource. In more realistic scheduling problems, it is likely that there will be a wider space of possible decisions. As noted in Part I, Getting Started with Scheduler, there are joint scheduling and resource allocation problems where both the resources assigned and the timing of the activities must be decided. In this chapter, we take such a problem and construct a local search algorithm.
PREVIOUS
NEXT