Tighter Bounds for the Multifit Processor Scheduling Algorithm

This paper considers the problem of nonpreemptively scheduling n independent jobs on m identical, parallel processors with the object of minimizing the “makespan”, or completion time for the entire...