| Article ID: | iaor20106359 |
| Volume: | 47 |
| Issue: | 1 |
| Start Page Number: | 61 |
| End Page Number: | 76 |
| Publication Date: | Sep 2010 |
| Journal: | Computational Optimization and Applications |
| Authors: | Vazacopoulos Alkis, Pardalos Panos M, Shylo Oleg V |
| Keywords: | heuristics |
In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and ‘big valley’ properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.