Showing 1 - 10 of 41
Persistent link: https://www.econbiz.de/10011978872
Persistent link: https://www.econbiz.de/10014383062
Persistent link: https://www.econbiz.de/10011990115
Persistent link: https://www.econbiz.de/10011622057
Persistent link: https://www.econbiz.de/10011628281
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/10005257065
Persistent link: https://www.econbiz.de/10005277600
Persistent link: https://www.econbiz.de/10011543366
Persistent link: https://www.econbiz.de/10011497244