Skip to main content
SpringerLink
Log in

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

A recent paper (Davidović et al., J. Heuristics, 18:549–569, 2012) presented a bee colony metaheuristic for scheduling independent tasks to identical processors, evaluating its performance on a benchmark set of instances from the literature. We examine two exact algorithms from the literature, the former published in 1995, the latter in 2008 (and not cited by the authors). We show that both such algorithms solve to proven optimality all the considered instances in a computing time that is several orders of magnitude smaller than the time taken by the new algorithm to produce an approximate solution.

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

  • Davidović, T., Crainic, T.G.: Benchmark problem instances for static task scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 33, 2155–2177 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Davidović, T., Šelmić, M., Teodorović, D., Ramljak, D.: Bee colony optimization for scheduling independent tasks to identical processors. J. Heuristics 18, 549–569 (2012)

    Article  Google Scholar 

  • Dell’Amico, M., Iori, M., Martello, S., Monaci, M.: Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J. Comput. 20, 333–344 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  • Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  • Tobita, T., Kasahara, H.: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. J. Sched. 5, 379–394 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISMI, Università di Modena e Reggio Emilia, Via Amendola 2, 42122, Reggio Emilia, Italy

    Mauro Dell’Amico & Manuel Iori

  2. DEIS, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Silvano Martello

  3. DEI, Università di Padova, Via Gradenigo 6/A, 35131, Padova, Italy

    Michele Monaci

Authors
  1. Mauro Dell’Amico
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Iori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvano Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michele Monaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Silvano Martello.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dell’Amico, M., Iori, M., Martello, S. et al. A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. J Heuristics 18, 939–942 (2012). https://doi.org/10.1007/s10732-012-9209-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-012-9209-3

Keywords

Search

Navigation