Showing 121 - 130 of 161
The paper surveys the complexity results for job shop, flow shop, open shop and mixed shop scheduling problems when the number n of jobs is fixed while the number r of operations per job is not restricted. In such cases, the asymptotical complexity of scheduling algorithms depends on the number...
Persistent link: https://www.econbiz.de/10010950258
Persistent link: https://www.econbiz.de/10005318180
Persistent link: https://www.econbiz.de/10005337356
Persistent link: https://www.econbiz.de/10005348036
Persistent link: https://www.econbiz.de/10005253744
Persistent link: https://www.econbiz.de/10006604815
Persistent link: https://www.econbiz.de/10007391444
Persistent link: https://www.econbiz.de/10007391810
Persistent link: https://www.econbiz.de/10004057194
Persistent link: https://www.econbiz.de/10005919977