Precedence constrained scheduling in (2-73p+1)·optimal

Authors:
Devdatta Gangal;Abhiram Ranade
Affiliations:
Department of Computer Science and Engg., Indian Institute of Technology Bombay, Powai, Mumbai 400076, India;Department of Computer Science and Engg., Indian Institute of Technology Bombay, Powai, Mumbai 400076, India
Venue:
Journal of Computer and System Sciences
Year:
2008

Citing 2
Cited 2

A New Insight into the Coffman-Graham Algorithm

SIAM Journal on Computing
Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)

Conditional hardness of precedence constrained scheduling on identical machines

Proceedings of the forty-second ACM symposium on Theory of computing
Hardness of Precedence Constrained Scheduling on Identical Machines

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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