Performance guarantees of local search for multiprocessor scheduling

P. Schuurman, T. Vredeveld

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

25 Citations (Scopus)

Abstract

This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.
Original languageEnglish
Title of host publicationInteger programming and combinatorial optimization : Proceedings 8th international IPCO conference, Utrecht, The Netherlands, June 13-15, 2001
EditorsK. Aardal, B. Gerards
Place of PublicationBerlin
PublisherSpringer
Pages370-382
ISBN (Print)3-540-42225-0
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
Volume2081
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Performance guarantees of local search for multiprocessor scheduling'. Together they form a unique fingerprint.

Cite this