Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

DOI10.1007/978-3-642-12450-1_16zbMath1284.90024OpenAlexW1597152453WikidataQ57399772 ScholiaQ57399772MaRDI QIDQ3558924

Felix G. König, Elisabeth Günther, Nicole Megow

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15659

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

This page was built for publication: Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width