Sciweavers

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

17

FOCS
2005
IEEE

favoriteEmaildiscussreport

83views Theoretical Computer Science» more FOCS 2005»

Approximation Algorithms for Scheduling on Multiple Machines

14 years 15 days ago

Approximation Algorithms for Scheduling on Multiple Machines

Download www.cs.umd.edu

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

Real-time Traffic

FOCS 2005 | Theoretical Computer Science |

claim paper

Related Content

» Minimizing Busy Time in Multiple Machine Realtime Scheduling

» A Randomized Algorithm for Flow Shop Scheduling

» Grouping Techniques for Scheduling Problems Simpler and Faster

» Genetic Programming Heuristics for Multiple Machine Scheduling

» Order Scheduling Models Hardness and Algorithms

» A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

» An Experimental Study of Algorithms for Weighted Completion Time Scheduling

» Approximation algorithm for minimizing total latency in machine scheduling with deliveries

» Fast Monotone 3Approximation Algorithm for Scheduling Related Machines

Post Info
More Details (n/a)

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

Comments (0)