iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BF01952782
A modification of Hochbaum and Shmoys' algorithm for scheduling problems | BIT Numerical Mathematics Skip to main content
Springer Nature Link
Log in

A modification of Hochbaum and Shmoys' algorithm for scheduling problems

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The dual approximation algorithm of Hochbaum and Shmoys for solving the minimum makespan problem on a set of identical machines is modified in such a way that it turns into an optimal algorithm when the relative error is chosen properly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Garey, M. R., and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman. San Francisco. 1979.

    Google Scholar 

  2. Graham, R. L.,Bounds for certain multiprocessing anomalies, Bell Syst. Tech. J. 45 (1966), 1563–1581.

    Google Scholar 

  3. Hochbaum, D. S., and Shmoys, D. B.,Using dual approximation algorithms for scheduling problems: theoretical and practical results, J. ACM 34 (1987).

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Katholieke Universiteit Leuven, Celestijnenlaan 200B, B-3030, Leuven, Belgium

    H. van de Vel & Sun Shijie

  2. Department of Mathematics, Shanghai University of Science and Technology, Shanghai, People's Republic of China

    H. van de Vel & Sun Shijie

Authors
  1. H. van de Vel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sun Shijie
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

van de Vel, H., Shijie, S. A modification of Hochbaum and Shmoys' algorithm for scheduling problems. BIT 31, 50–52 (1991). https://doi.org/10.1007/BF01952782

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01952782

CR categories

Key words

Search

Navigation