| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142471 | Operations Research Letters | 2012 | 5 Pages |
Abstract
We study the performance of two popular jump neighborhoods on the classical scheduling problem of minimizing the makespan on related parallel machines under the additional restriction that jobs are only allowed to be scheduled on a subset of machines. In particular, we analyze the performance guarantee of local optima with respect to the jump and the lexicographical jump neighborhood.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
C. Rutten, D. Recalde, P. Schuurman, T. Vredeveld,