NG, C. T.; MATSVEICHUK, NATALJA M.; SOTSKOV, YURI N.; … - In: Asia-Pacific Journal of Operational Research (APJOR) 26 (2009) 06, pp. 715-734
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,...