Performance guarantees of local search for multiprocessor scheduling (full version accepted for Informs Journal on Computing), In Karen Aardal and Bert Gerards (eds.): Integer Programming and Combinatorial Optimization

P. Schuurman, T. Vredeveld

    Research output: Contribution to journalArticleAcademicpeer-review


    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
    Pages (from-to)370-382
    JournalLecture Notes in Computer Science
    Publication statusPublished - 1 Jan 2001

    Cite this