Sciweavers

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

12

JCSS
2008

favoriteEmaildiscussreport

96views more JCSS 2008»

Precedence constrained scheduling in (2 - 7/(3p+1)) optimal

13 years 4 months ago

Precedence constrained scheduling in (2 - 7/(3p+1)) optimal

Download www.cse.iitb.ac.in

We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as long as the optimal, where p > 3 is the number of processors. This improves upon a long standing bound of 2 - 2 p due to Coffman and Graham. 1

Devdatta Gangal, Abhiram G. Ranade

Real-time Traffic

Algorithm Guarantees Schedules | JCSS 2008 | Time Approximation Algorithm | Unit Time |

claim paper

Related Content

» Inapproximability Results for Sparsest Cut Optimal Linear Arrangement and Precedence Const...

» EnergyAware Duplication Strategies for Scheduling PrecedenceConstrained Parallel Tasks on ...

» Largescale multiperiod precedence constrained knapsack problem A mining application

» Scheduling with Precedence Constraints of Low Fractional Dimension

» A Constraint Integer Programming Approach for ResourceConstrained Project Scheduling

» Energyefficient Scheduling of Delay Constrained Traffic over Fading Channels

» STARS Static relays for multirobot realtime search and monitoring

» A ConstraintBased Method for Project Scheduling with Time Windows

» A Framework for ResourceConstrained RateOptimal Software Pipelining

» Multilevel clustering for clock skew optimization

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCSS
Authors	Devdatta Gangal, Abhiram G. Ranade

Comments (0)