Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

D. Recalde*, C. Rutten, P. Schuurman, T. Vredeveld

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


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.
Original languageEnglish
Title of host publicationLATIN 2010: Theoretical Informatics. LATIN 2010.
Subtitle of host publicationLecture Notes in Computer Science
EditorsA. López-Ortiz
PublisherSpringer, Berlin, Heidelberg
ISBN (Electronic)978-3-642-12200-2
ISBN (Print)978-3-642-12199-9
Publication statusPublished - 1 Jan 2010
Event9th Latin American Symposium -
Duration: 19 Apr 201023 Apr 2010

Publication series

SeriesLecture Notes in Computer Science


Conference9th Latin American Symposium


  • local search
  • performance guarantee
  • restricted machines
  • eligibility constraints

Cite this