Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
From MaRDI portal
Publication:3521923
DOI10.1007/978-3-540-70575-8_20zbMath1152.90446MaRDI QIDQ3521923
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://macau.uni-kiel.de/receive/macau_mods_00001866
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
Related Items
Worst-case analysis of LPT scheduling on a small number of non-identical processors, Scheduling malleable tasks with precedence constraints, An effective approximation algorithm for the malleable parallel task scheduling problem, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width