Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2

From MaRDI portal

Revision as of 23:41, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3521923

Jump to:navigation, search

DOI10.1007/978-3-540-70575-8_20zbMath1152.90446OpenAlexW147095987MaRDI QIDQ3521923

Ralf Thöle, Klaus Jansen

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

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

This page was built for publication: Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3521923&oldid=16883315"