Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

82

APPROX
2005
Springer

73views Algorithms» more APPROX 2005»

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

15 years 8 months ago

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

Download www.cs.umd.edu

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa

Real-time Traffic

Algorithms | APPROX 2005 |

claim paper

Related Content

» Review of properties of different precedence graphs for scheduling problems

» Improved Approximations for Multiprocessor Scheduling Under Uncertainty

» On the Approximability of Average Completion Time Scheduling under Precedence Constraints

» Scheduling with Precedence Constraints of Low Fractional Dimension

» Nonapproximability Results for Scheduling Problems with Minsum Criteria

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APPROX
Authors	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan

Comments (0)