A comparison of heuristics for schedulin
✍
A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 266 KB
We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know