Skip to main content
SpringerLink
Log in

Maximizing the minimum completion time on parallel machines

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as an effective symmetry-breaking branching strategy. Computational results performed on a large set of randomly generated instances attest to the efficacy of the proposed algorithm.

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

Similar content being viewed by others

References

  • Azar Y, Epstein L (1997) On-line machine covering. Lect Notes Comput Sci 1284:23–36

    Article  Google Scholar 

  • Csirik J, Kellerer H, Woeginger G (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11:281–287

    Article  Google Scholar 

  • Dell’Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7:191–200

    Google Scholar 

  • Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Algorithms Discret Methods 3:190–196

    Article  Google Scholar 

  • Haouari M, Gharbi A (2004) Lower bounds for scheduling on identical parallel machines with heads and tails. Ann Oper Res 129:187–204

    Article  Google Scholar 

  • Haouari M, Gharbi A, Jemmali M (2006) Tight bounds for the identical parallel machine scheduling problem. Int Trans Oper Res 13:529–548

    Article  Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SS, Rinnooy Kan AHG, Zipkin P (eds) Handbooks in operations research and management science, vol 4, pp 445–522

  • Pisinger D (2003) Dynamic programming on the word RAM. Algorithmica 35:437–459

    Google Scholar 

  • Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Manage Sci 47:1396–1407

    Article  Google Scholar 

  • Tan ZY, He Y (2002) Ordinal on-line scheduling for maximizing the minimum machine completion time. J Comb Optim 6:199–206

    Article  Google Scholar 

  • Woeginger GJ (1997) A polynomial time approximation scheme for maximizing the minimum completion time. Oper Res Lett 20:149–154

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Combinatorial Optimization Research Group-ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia

    Mohamed Haouari & Mahdi Jemmali

  2. Faculty of Business Administration, Bilkent University, Ankara, Turkey

    Mohamed Haouari

Authors
  1. Mohamed Haouari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahdi Jemmali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Haouari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haouari, M., Jemmali, M. Maximizing the minimum completion time on parallel machines. 4OR 6, 375–392 (2008). https://doi.org/10.1007/s10288-007-0053-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-007-0053-5

Keywords

MSC classification

Search

Navigation