论文信息 - Precedence constrained scheduling in (2 - 7/(3p+1)) optimal

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

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 p>3 is the number of processors. This improves upon a long standing bound of (2-2p) due to Coffman and Graham.

Abhiram G. Ranade | Devdatta Gangal

[1] Shui Lam,et al. Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..

[2] Denis Trystram,et al. A New Insight into the Coffman-Graham Algorithm , 1994, SIAM J. Comput..

[3] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[4] M. Fujii,et al. Optimal Sequencing of Two Equivalent Processors , 1969 .

[5] Ronald L. Graham,et al. Optimal scheduling for two-processor systems , 1972, Acta Informatica.

[6] David S. Johnson,et al. Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

[7] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .