Li, Chung-Lun; Li, Qingying - In: Journal of the Operational Research Society 66 (2015) 3, pp. 516-523
We consider the problem of scheduling a given set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a given release date and is compatible to only a subset of the machines. The machines are ordered and indexed in such a way that a...