Implementation of a Scheduler for the Microelectronics Clean-Room

This report presents the implementation of a scheduler for the operations in the micro-electronics clean-room of ITC-Irst. The scheduling problem in this environment is a variant of the classical job-shop scheduling problem. Since all known exact solutions to this problem have exponential time complexity, a heuristic based approximate solution has been attempted. A modified version of the shifting bottleneck is employed to obtain good approximate solutions quickly. This scheduler has been incorporated with the information system of the ITC-Irst clean-room