Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

DOI10.1007/978-3-642-12450-1_16MaRDI QIDQ3558924zbMATH OpenOpenAlexWikidataFDO

Authors Elisabeth Günther, Felix G. König, 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

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

Recommendations

• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• scientific article; zbMATH DE number 1875414
• Scheduling malleable tasks with precedence constraints
• Algorithms and Computation
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Precedence-constrained scheduling of malleable jobs with preemption
• Packing-based branch-and-bound for discrete malleable task scheduling
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

Cited in

(4)

• Packing-based branch-and-bound for discrete malleable task scheduling
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• Strip packing with precedence constraints and strip packing with release times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558924)