Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

@article{Chudak1997ApproximationAF,
  title={Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds},
  author={Fabi{\'a}n A. Chudak and David B. Shmoys},
  journal={J. Algorithms},
  year={1997},
  volume={30},
  pages={323-343}
}
We present new approximation algorithms for the problem of scheduling precedence-constrained jobs on parallel machines that are uniformlv related. That is. there are it iobs and m machines; each-job j requires pj &its of proce&ng, and is to be processed on one machine without interruption; if it is assigned to machine i, which runs at a given speed si, it takes vi/s; time units. There also is a Dartial order 4 -9, . on the jobs, where j + Ic implies that job & may not start processing until job… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
55 Citations
4 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 55 extracted citations

References

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

Bounds for certain multiprocessing anomalies

  • R. L. Graham
  • Bell System Tech. J. 45 1563-1581.
  • 1966
Highly Influential
10 Excerpts

Scheduling and Polytopes

  • A. S. Schulz
  • PhD thesis, Technische Universitgt Berlin, Berlin…
  • 1996
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…