| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142628 | Operations Research Letters | 2011 | 6 Pages |
Abstract
⺠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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gaurav Singh, Andreas T. Ernst,