Sotskov, Y. Et Al. 2004. Flowshop scheduling problem to minimize total completion time with random and bounded processing times. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY , no.3 , 277-286.

Sotskov, Y., Allahverdi, A., & Lai, T., (2004). Flowshop scheduling problem to minimize total completion time with random and bounded processing times. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY , no.3, 277-286.

Sotskov, Y.N., ALİ ALLAHVERDİ, And T.-C. Lai. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times," JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY , no.3, 277-286, 2004

Sotskov, Y.N. Et Al. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times." JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY , no.3, pp.277-286, 2004

Sotskov, Y. Allahverdi, A. And Lai, T. (2004) . "Flowshop scheduling problem to minimize total completion time with random and bounded processing times." JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY , no.3, pp.277-286.

@article{article, author={Y.N. Sotskov Et Al. }, title={Flowshop scheduling problem to minimize total completion time with random and bounded processing times}, journal={JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY}, year=2004, pages={277-286} }