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.
Original language | English |
---|---|
Pages (from-to) | 287-291 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 40 |
Issue number | 4 |
DOIs | |
Publication status | Published - Jul 2012 |
Keywords
- Scheduling on restricted machines
- Approximation algorithms
- Jump neighborhoods
- Performance guarantee
- PROCESSING SET RESTRICTIONS
- LOCAL SEARCH
- EQUILIBRIA