We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In particular, we analyze the quality of local optima with respect to the jump, swap, push and lexicographical jump neighborhood.
|Series||Lecture Notes in Computer Science|
|Conference||9th Latin American Symposium|
|Period||19/04/10 → 23/04/10|
- local search
- performance guarantee
- restricted machines
- eligibility constraints