Minimizing Makespan on Identical Parallel Machines

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.



Titolo: Minimizing Makespan on Identical Parallel Machines
Autori: 
PALETTA, Giuseppe
mostra contributor esterni 
Data di pubblicazione: 2015
Rivista: 
INTERNATIONAL JOURNAL OF OPERATIONS RESEARCH AND INFORMATION SYSTEMS  
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

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/20.500.11770/149873
  • Citazioni
  • PubMed Central ND
  • Scopus ND
  • WOS ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021