Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Approximation algorithms for shop scheduling problems with minsum objective: A correction

  • Technical Note
  • Published:
Journal of Scheduling Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We present a correction to the paper, “Approximation algorithms for shop scheduling problems with minsum objective” (Journal of Scheduling 2002; 5:287–305) by Queyranne and Sviridenko. This correction provides a correct derivation of its 2eρ approximation result.

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Queyranne, M. and M. Sviridenko, “Approximation algorithms for shop scheduling problems with minsum objective,” Journal of Scheduling, 5, 287–305 (2002).

    Article  Google Scholar 

  • Yuan, J. J. and W. H, Li, Private Communication, 2004.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, 450052, China

    Wenhua Li & Jinjiang Yuan

  2. Sauder School of Business, University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2

    Maurice Queyranne

  3. IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, U.S.A.

    Maxim Sviridenko

Authors
  1. Wenhua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Queyranne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maxim Sviridenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenhua Li.

Additional information

Wenhua Li and Jinjiang Yuan: Project supported by NNSFC (Grant 10371112) and NSFHN (Grant 0411011200).

Maurice Queyranne: Supported by research grants from NSERC, the Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, W., Queyranne, M., Sviridenko, M. et al. Approximation algorithms for shop scheduling problems with minsum objective: A correction. J Sched 9, 569–570 (2006). https://doi.org/10.1007/s10951-006-8790-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-8790-4

Keywords

Search

Navigation