Showing 1 - 10 of 119
We study the problem of minimizing the makespan on m parallel machines. We introduce a very large-scale neighborhood of exponential size (in the number of machines) that is based on a matching in a complete graph. The idea is to partition the jobs assigned to the same machine into two sets. This...
Persistent link: https://www.econbiz.de/10005219992
Persistent link: https://www.econbiz.de/10008667383
Persistent link: https://www.econbiz.de/10009405070
Persistent link: https://www.econbiz.de/10009410523
Persistent link: https://www.econbiz.de/10010241944
Persistent link: https://www.econbiz.de/10009681524
Persistent link: https://www.econbiz.de/10010375249
Persistent link: https://www.econbiz.de/10010491636
Persistent link: https://www.econbiz.de/10010479966
Persistent link: https://www.econbiz.de/10003472714