Performance Guarantees of Local Search for Multiprocessor Scheduling

P. Schuurman, T. Vredeveld

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

    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 publication Integer Programming and Combinatorial Optimization. IPCO 2001
    EditorsK. Aardal, B. Gerards
    PublisherSpringer, Berlin, Heidelberg
    Pages370-382
    ISBN (Electronic)978-3-540-45535-6
    ISBN (Print)978-3-540-42225-9
    DOIs
    Publication statusPublished - 21 Jun 2001

    Publication series

    SeriesLecture Notes in Computer Science
    Volume2081
    ISSN0302-9743

    Fingerprint

    Dive into the research topics of 'Performance Guarantees of Local Search for Multiprocessor Scheduling'. Together they form a unique fingerprint.

    Cite this