Quality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads
|Abstract:||We study the problem of minimizing the vector norm of the workloads. We examine move-optimal assignments and prove a performance guarantee of|
for any integer and moreover, we show that this guarantee is tight.
Additionally, we consider assignments obtained by applying the LPT-heuristic of Graham (1969). We prove that an LPT-assignment has a performance guarantee of
which reproves a result of Chandra and Wong (1975).
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/66527|
|Export this item as:||BibTeX|
Show download statistics for this publication
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 238242