Approximation Schemes for Scheduling


We consider the classic scheduling/load balancing problems where there are m identical machines and n jobs, and each job should be assigned to some machine. Traditionally, the assignment of jobs to machines is measured by the makespan (maximum load) i.e., the L, norm of the assignment. An Eapproximation scheme was given by Hochbaum and Shmoys [lo] for… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics