Showing 1 - 4 of 4
Persistent link: https://www.econbiz.de/10014383062
Persistent link: https://www.econbiz.de/10011990115
Persistent link: https://www.econbiz.de/10010222709
The flow-shop minimum-length scheduling problem with n jobs processed on two machines is addressed where processing times are uncertain: only lower and upper bounds of the random processing times are given before scheduling, but their probability distributions are unknown. For such a problem,...
Persistent link: https://www.econbiz.de/10008487389