4.7 Article

A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints

Related references

Note: Only part of the references are listed.
Article Computer Science, Hardware & Architecture

Scheduling malleable tasks with precedence constraints

Klaus Jansen et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2012)

Article Computer Science, Theory & Methods

Strip packing with precedence constraints and strip packing with release times

John Augustine et al.

THEORETICAL COMPUTER SCIENCE (2009)

Article Computer Science, Theory & Methods

A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks

Gregory Mounie et al.

SIAM JOURNAL ON COMPUTING (2007)

Article Computer Science, Theory & Methods

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints

Klaus Jansen et al.

ACM TRANSACTIONS ON ALGORITHMS (2006)

Article Computer Science, Software Engineering

Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme

K Jansen

ALGORITHMICA (2004)

Article Management

An approximation algorithm for scheduling trees of malleable tasks

R Lepère et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)