A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructedby using the current solution is developed to solve a classical multiprocessor scheduling problem withthe objective of minimizing the makespan. Computational results indicate that the proposed algorithm is verycompetitive with respect to well-known constructive algorithms for a large number of benchmark instances.
Minimizing Makespan on Identical Parallel Machines / Kuruvilla, A; Paletta, Giuseppe. - In: INTERNATIONAL JOURNAL OF OPERATIONS RESEARCH AND INFORMATION SYSTEMS. - ISSN 1947-9328. - 6:1(2015), pp. 19-29.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Minimizing Makespan on Identical Parallel Machines |
Autori: | |
Data di pubblicazione: | 2015 |
Rivista: | |
Citazione: | Minimizing Makespan on Identical Parallel Machines / Kuruvilla, A; Paletta, Giuseppe. - In: INTERNATIONAL JOURNAL OF OPERATIONS RESEARCH AND INFORMATION SYSTEMS. - ISSN 1947-9328. - 6:1(2015), pp. 19-29. |
Handle: | http://hdl.handle.net/20.500.11770/149873 |
Appare nelle tipologie: | 1.1 Articolo in rivista |