![](/img/cover-not-exists.png)
Flowshop scheduling problem to minimize total completion time with random and bounded processing times
Sotskov, Y N, Allahverdi, A, Lai, T-CVolume:
55
Language:
english
Journal:
Journal of the Operational Research Society
DOI:
10.1057/palgrave.jors.2601682
Date:
March, 2004
File:
PDF, 230 KB
english, 2004