Global and Local Search for Scheduling Job Shop with Parallel Machines
Classical Job Shop Scheduling problem describes operation in several industries. In this classical model, there is only one machine available for each group of tasks, and the precedence relations between the tasks are restricted to serial-parallel. Here we suggest a generaliza- tion, which allows parallel unrelated machines and arbitrary precedence relations between the tasks. The feasible solution space of the generali- zed problem (which is significantly larger than that of a corresponding version without parallel machines) is efficiently reduced to an essenti- ally smaller subset. The use of this reduced subset, instead of the whole feasible set, is beneficial. We propose global and local search algorithms which start from the reduced solution set.
Key wordsscheduling job shop parallel machines search tree global and local search
Unable to display preview. Download preview PDF.
- Balas E. and A. Wazacopoulos, “Guided Local Search with Shifting Bottleneck for Job Shop Scheduling”, Management Science Research Report MSRR-609, Carnegie-Mellon University (1994).Google Scholar
- Glover F., “Tabu-search: A tutorial”, Interfaces, 20, 74–94 (1990).Google Scholar
- Kirkpatrick S, C.D. Gelant and M.P. Vecchi, “Optimization by simulated annealing”, Science, 220, 924–928 (1983)Google Scholar
- Lawton G., “Generic algorithms for schedule optimization”, AI Expert, May, 23–27 (1992).Google Scholar
- Morton T.E. and D. Pentico, “Heuristic scheduling systems”, Wiley (1993).Google Scholar
- Vakhania N., “The Construction of the Reduced Solution Tree for the Job Shop Scheduling Problem”, Discrete Mathematics 2,10–20 (1990).Google Scholar
- Vakhania N., “Assignment of jobs to parallel computers of different throughput”, Automation and Remote Control 56, 280–286 (1995).Google Scholar