Generalized Assignment Problems n jobs and m machines s ij : size of job/item j on machine/bin i Assignment: A function f: jobs → machines . f(j) is the machine to which job j is assigned Minimum makespan : find f to minimize maximum load: max i ∑ j: f(j) = i s ij Note: problem also called unrelated machine scheduling