Experimental comparison of approximation algorithms for scheduling unrelated parallel machines,

T. Vredeveld*, C. Hurkens

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    22 Citations (Web of Science)


    T his paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-relaxation or to a convex quadratic-programming relaxation. We also investigate dominance relations among the lower bounds resulting from these relaxations.
    Original languageEnglish
    Pages (from-to)175-189
    JournalInforms Journal on Computing
    Publication statusPublished - 1 Jan 2002

    Cite this