Showing 71 - 80 of 122
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/10005257065
In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive...
Persistent link: https://www.econbiz.de/10005257140
Persistent link: https://www.econbiz.de/10014566935
Persistent link: https://www.econbiz.de/10006604815
Persistent link: https://www.econbiz.de/10007391444
Persistent link: https://www.econbiz.de/10007391810