Showing 81 - 90 of 122
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
Persistent link: https://www.econbiz.de/10004057194
Persistent link: https://www.econbiz.de/10004752123
Persistent link: https://www.econbiz.de/10005919977
Persistent link: https://www.econbiz.de/10006641236
Persistent link: https://www.econbiz.de/10006646481