Performance guarantees of jump neighborhoods on restricted related parallel machines

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

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)287-291
Number of pages5
JournalOperations Research Letters
Volume40
Issue number4
DOIs
Publication statusPublished - Jul 2012

Keywords

  • Scheduling on restricted machines
  • Approximation algorithms
  • Jump neighborhoods
  • Performance guarantee
  • PROCESSING SET RESTRICTIONS
  • LOCAL SEARCH
  • EQUILIBRIA

Cite this