Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

Authors:
Tjark Vredeveld;Cor Hurkens
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
2002

Citing 0
Cited 4

Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

Computers and Operations Research
An artificial bee colony algorithm for the unrelated parallel machines scheduling problem

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This 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.