Sciweavers

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

44

ESA
1999
Springer

favoriteEmaildiscussreport

148views Algorithms» more ESA 1999»

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

14 years 3 months ago

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Download math.haifa.ac.il

We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the lp norm of the vector of completion times. This generalizes and simpliﬁes many previous results in this area.

Leah Epstein, Jiri Sgall

Real-time Traffic

Algorithms | Completion Times | ESA 1999 | Machine Completion Times | Polynomial Approximation Scheme |

claim paper

Related Content

» Biobjective Approximation Scheme for Makespan and Reliability Optimization on Uniform Para...

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Preemptive Scheduling with Rejection

» Parallel Machine Scheduling Problems with Controllable Processing Times

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

» Online scheduling with a buffer on related machines

» Online Scheduling with Bounded Migration

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ESA
Authors	Leah Epstein, Jiri Sgall

Comments (0)