Showing 1 - 9 of 9
Persistent link: https://www.econbiz.de/10006641816
Persistent link: https://www.econbiz.de/10006641837
Persistent link: https://www.econbiz.de/10006656068
The paper studies a flowshop scheduling problem where machines are not available in given time intervals. The objective is to minimize the makespan. The problem is known to be NP-hard for two machines. We analyze constructive and local search based heuristic algorithms for the two-machine case....
Persistent link: https://www.econbiz.de/10005333929
Persistent link: https://www.econbiz.de/10005337850
Persistent link: https://www.econbiz.de/10005278033
Persistent link: https://www.econbiz.de/10005283469
Persistent link: https://www.econbiz.de/10008819535
Persistent link: https://www.econbiz.de/10006771819