A note on exact and heuristic algorithms for the identical parallel machine scheduling problem |
| |
Authors: | Mauro Dell’Amico Manuel Iori Silvano Martello Michele Monaci |
| |
Affiliation: | 1. DISMI, Universit?? di Modena e Reggio Emilia, Via Amendola 2, 42122, Reggio Emilia, Italy 2. DEIS, Universit?? di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy 3. DEI, Universit?? di Padova, Via Gradenigo 6/A, 35131, Padova, Italy
|
| |
Abstract: | A recent paper (Davidovi? et al., J. Heuristics, 18:549?C569, 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|