Showing 1 - 8 of 8
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...
Persistent link: https://www.econbiz.de/10011153384
Persistent link: https://www.econbiz.de/10014231639
Persistent link: https://www.econbiz.de/10012212980
Persistent link: https://www.econbiz.de/10012214263
Persistent link: https://www.econbiz.de/10012314418
Persistent link: https://www.econbiz.de/10012653161
Persistent link: https://www.econbiz.de/10014446152
Persistent link: https://www.econbiz.de/10014555748