Approximability of Average Completion Time Scheduling on Unrelated Machines

DOI10.1007/978-3-540-87744-8_64zbMath1158.90356OpenAlexW1601830085MaRDI QIDQ3541134

R. A. Sitters

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25102

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (3)

Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ Minimizing Average Flow Time on Unrelated Machines

This page was built for publication: Approximability of Average Completion Time Scheduling on Unrelated Machines