IBM ILOG Scheduler User's Manual > Advanced Concepts > Scheduling with Unary Resources: the Job-Shop Problem > Computational Remarks: Where to Go from Here

Computational Remarks: Where to Go from Here

INDEX Gray bullet PREVIOUS NEXT

This program does not prove to be very efficient for solving the job-shop scheduling problem. Only MT06 is solved in a reasonable amount of time. Many optimizing iterations are necessary to solve MT10, with the final iterations requiring a great deal of computational time. MT20 remains unsolved after much computational time.

These observations suggest three ways of improving the algorithm.

  1. Attempt to reduce the number of iterations.
  2. Attempt to simplify the most difficult iterations.
  3. Attempt to generate good solutions quickly, rather than seeking the optimal solution.

Chapter 16 discusses points 1 and 2 and proposes a better algorithm for the job-shop scheduling problem. Point 3 is covered in Chapter 30 and offers a third algorithm, which generates an optimal solution for MT20.

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