IBM ILOG Scheduler User's Manual > Local Search in Scheduler > Shuffling as Local Search in Scheduler > Problem Description

Problem Description

INDEX Gray bullet PREVIOUS NEXT

The problem used here is the standard job shop scheduling problem as defined in Scheduling with Unary Resources: the Job-Shop Problem. As we have seen the way in which the problem is modeled in previous chapters, we will move directly to the search mechanism.

© Copyright IBM Corp. 1987, 2009. Legal terms. PREVIOUS NEXT