| Article ID: | iaor20119257 |
| Volume: | 39 |
| Issue: | 5 |
| Start Page Number: | 363 |
| End Page Number: | 368 |
| Publication Date: | Sep 2011 |
| Journal: | Operations Research Letters |
| Authors: | Singh Gaurav, Ernst Andreas T |
| Keywords: | programming: integer, heuristics: genetic algorithms, optimization: simulated annealing |
We present a scheduling problem with a single shared resource. We compare ILP and Lagrangian methods with simulated annealing and genetic algorithms. Computational results show that ILP could only solve very small size instances. The Lagrange relaxation method was better than the metaheuristics for large instances. In small instances, the metaheuristics were found close to optimum solutions.