Skip to main content
SpringerLink
Log in

A note on minimizing the sum of squares of machine completion times on two identical parallel machines

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In this short note, we address the coherence between minimizing the sum of squares of machine completion times and minimizing makespan on two identical parallel machines. We show equivalence of the two objectives and identify interesting and useful relations which allow us to transfer worst-case ratios of approximation algorithms from one problem to the other.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Alon N, Azar Y, Woeginger GJ, Yadid T (1997) Approximation schemes for scheduling. In: Proceedings of the 8th symposium on discrete algorithms, pp 493–500

  • Chandra AK, Wong CK (1975) Worst-case analysis of a placement algorithm related to storage allocation. SIAM J Comput 4:249–263

    Article  Google Scholar 

  • Cody RA, Coffman EG (1976) Record allocation for minimizing expected retrieval costs on drum-like storage devices. J ACM 23:103–115

    Article  Google Scholar 

  • Goldberg RR, Shapiro J (1999) A tight upper bound for the \(k\)-partition problem on ideal sets. Oper Res Lett 24:164–173

    Article  Google Scholar 

  • Goldberg RR, Shapiro J (2000) Partitioning under the \(L_p\) norm. Eur J Oper Res 123:585–592

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco

    Google Scholar 

  • Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416–429

    Article  Google Scholar 

  • Koulamas C, Kyparisis GJ (2008) An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines. Eur J Oper Res 187:660–666

    Article  Google Scholar 

  • Lee C-Y, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discret Appl Math 20:233–242

    Article  Google Scholar 

  • Leung JY-T, Wei W-D (1995) Tighter bounds on a heuristic for a partition problem. Inf Process Lett 56:51–57

    Article  Google Scholar 

Download references

Acknowledgments

The author is grateful to the anonymous referee for his/her valuable comments which helped to improve the quality of the note.

Author information

Authors and Affiliations

  1. Department of Optimization, Fraunhofer Institute for Industrial Mathematics ITWM, Fraunhofer-Platz 1, 67663, Kaiserslautern, Germany

    Rico Walter

Authors
  1. Rico Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rico Walter.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Walter, R. A note on minimizing the sum of squares of machine completion times on two identical parallel machines. Cent Eur J Oper Res 25, 139–144 (2017). https://doi.org/10.1007/s10100-015-0429-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-015-0429-0

Keywords

Search

Navigation