We consider the classical problem of scheduling n tasks with given processing time on m identical parallel processors so as to minimizethe maximum completion time of a task. We introduce lower bounds, approximationalgorithms and a branch-and-bound procedure for the exact solution of theproblem. Extensive computational results show that, in many cases, large-sizeinstances of the problem can be solved exactly.
Optimal Scheduling of Taskson Identical Parallel Processors / Dell'Amico, Mauro; S., Martello. - In: ORSA JOURNAL ON COMPUTING. - ISSN 0899-1499. - STAMPA. - 7:(1995), pp. 181-200.
Optimal Scheduling of Taskson Identical Parallel Processors
DELL'AMICO, Mauro;
1995
Abstract
We consider the classical problem of scheduling n tasks with given processing time on m identical parallel processors so as to minimizethe maximum completion time of a task. We introduce lower bounds, approximationalgorithms and a branch-and-bound procedure for the exact solution of theproblem. Extensive computational results show that, in many cases, large-sizeinstances of the problem can be solved exactly.
Pubblicazioni consigliate
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
