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

Authors:
Mauro Dell'Amico;Manuel Iori;Silvano Martello;Michele Monaci
Affiliations:
DISMI, Università di Modena e Reggio Emilia, Reggio Emilia, Italy 42122;DISMI, Università di Modena e Reggio Emilia, Reggio Emilia, Italy 42122;DEIS, Università di Bologna, Bologna, Italy 40136;DEI, Università di Padova, Padova, Italy 35131
Venue:
Journal of Heuristics
Year:
2012

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

Computers and Operations Research
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem

INFORMS Journal on Computing
Bee colony optimization for scheduling independent tasks to identical processors

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.