A heuristic algorithm is developed for the classical multiprocessor scheduling problem in which independent jobs are nonpreemptively scheduled on identical parallel machines with the objective of minimizing the makespan. The algorithm uses iteratively the LPT procedure followed by the MultiFit procedure on different job and machine sets. The effectiveness of our algorithm is evaluated through computational comparisons with other methods from the literature for different classes of benchmark instances.
A new algorithm for minimizing makespan on identical parallel machines
PALETTA, Giuseppe
2012-01-01
Abstract
A heuristic algorithm is developed for the classical multiprocessor scheduling problem in which independent jobs are nonpreemptively scheduled on identical parallel machines with the objective of minimizing the makespan. The algorithm uses iteratively the LPT procedure followed by the MultiFit procedure on different job and machine sets. The effectiveness of our algorithm is evaluated through computational comparisons with other methods from the literature for different classes of benchmark instances.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
