The multiprocessor scheduling problem consists in scheduling a set of tasks with known processing times into a set of identical processors so as to minimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing problem. Computational results illustrating the effectiveness of this approach are reported and compared with those obtained by other heuristics.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling
Adriana C. F. Alvim
Celso C. Ribeiro
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA