We consider the classical P||Cmax problem (assign n jobs tom identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2.We briefly survey lower and upper boundsfrom the literature.We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem / Dell'Amico, Mauro; Iori, Manuel; S., Martello. - In: JOURNAL OF HEURISTICS. - ISSN 1381-1231. - STAMPA. - 10(2004), pp. 169-204. [10.1023/B:HEUR.0000026266.07036.da]

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

DELL'AMICO, Mauro;IORI, MANUEL;
2004

Abstract

We consider the classical P||Cmax problem (assign n jobs tom identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2.We briefly survey lower and upper boundsfrom the literature.We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.
10
169
204
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem / Dell'Amico, Mauro; Iori, Manuel; S., Martello. - In: JOURNAL OF HEURISTICS. - ISSN 1381-1231. - STAMPA. - 10(2004), pp. 169-204. [10.1023/B:HEUR.0000026266.07036.da]
Dell'Amico, Mauro; Iori, Manuel; S., Martello
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11380/451195
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 13
social impact