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

@article{Gangal2008PrecedenceCS,
  title={Precedence constrained scheduling in (2 - 7/(3p+1)) optimal},
  author={Devdatta Gangal and Abhiram G. Ranade},
  journal={J. Comput. Syst. Sci.},
  year={2008},
  volume={74},
  pages={1139-1146}
}
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most ( 
9 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Parallel Sequencing and Assembly Line Problems

  • T. Hu
  • Operations Research,
  • 1961
Highly Influential
4 Excerpts

Approximation Algorithms for Problems

  • M. Charikar
  • Combinatorial Optimization,
  • 1995
2 Excerpts

Optimal sequence of two equivalent processors

  • M. Fujii, T. Kasami, K. Ninomiya
  • SIAM J. Appl. Math., 17(3):784–789
  • 1969
2 Excerpts

Similar Papers

Loading similar papers…