| Article ID: | iaor20071181 |
| Country: | Netherlands |
| Volume: | 3 |
| Issue: | 4 |
| Start Page Number: | 331 |
| End Page Number: | 348 |
| Publication Date: | Sep 2006 |
| Journal: | Computational Management Science |
| Authors: | Pardalos Panos M., Shylo Oleg V. |
| Keywords: | heuristics |
The job shop scheduling problem is considered, and an algorithm based on the global equilibrium search method is proposed for its solution. Computational experiments using well-known benchmark problems are presented. Several new upper bounds for these problems are obtained.