Allahverdi, A. Et Al. 2003. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences , vol.2003, no.39 , 2475-2486.

Allahverdi, A., Aldowaisan, T., & Sotskov, Y. N., (2003). Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences , vol.2003, no.39, 2475-2486.

Allahverdi, ALİ, Tariq Aldowaisan, And Yuri N. Sotskov. "Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times," International Journal of Mathematics and Mathematical Sciences , vol.2003, no.39, 2475-2486, 2003

Allahverdi, ALİ Et Al. "Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times." International Journal of Mathematics and Mathematical Sciences , vol.2003, no.39, pp.2475-2486, 2003

Allahverdi, A. Aldowaisan, T. And Sotskov, Y. N. (2003) . "Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times." International Journal of Mathematics and Mathematical Sciences , vol.2003, no.39, pp.2475-2486.

@article{article, author={ALİ ALLAHVERDİ Et Al. }, title={Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times}, journal={International Journal of Mathematics and Mathematical Sciences}, year=2003, pages={2475-2486} }