Epstein, Leah; Levin, Asaf - In: International Journal of Production Economics 133 (2011) 2, pp. 586-595
We consider multiprocessor scheduling to minimize makespan. Each job has a given processing time and in addition, a subset of machines associated with it, also called its processing set. Each job has to be assigned to one machine in its set, thus contributing to the load of this machine. We...