@book{12b28bd4493f4144a42e95ca71545549,
title = "Move-optimal schedules for parallel machines to minimize total weighted completion time",
abstract = "We study the minimum total weighted completion time problem on identical machines, which is known to be strongly $\mathcal{NP}$-hard. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio $1.5$. In case all jobs have equal Smith ratios, the approximation ratio is at most $1.092$.",
keywords = "MSC-90B35, METIS-225250, IR-65932, EWI-3568",
author = "T. Brueggemann and Hurink, {Johann L.} and Walter Kern",
note = "Imported from MEMORANDA",
year = "2005",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum Afdeling TW",
publisher = "University of Twente",
number = "1748",
address = "Netherlands",
}