Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.

Allahverdi, Ali, Aldowaisan, Tariq, and Sotskov, Yuri N.. "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 2003.39 (2003): 2475-2486. <http://eudml.org/doc/50840>.

@article{Allahverdi2003,
author = {Allahverdi, Ali, Aldowaisan, Tariq, Sotskov, Yuri N.},
journal = {International Journal of Mathematics and Mathematical Sciences},
language = {eng},
number = {39},
pages = {2475-2486},
publisher = {Hindawi Publishing Corporation, New York},
title = {Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.},
url = {http://eudml.org/doc/50840},
volume = {2003},
year = {2003},
}

TY - JOUR
AU - Allahverdi, Ali
AU - Aldowaisan, Tariq
AU - Sotskov, Yuri N.
TI - Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.
JO - International Journal of Mathematics and Mathematical Sciences
PY - 2003
PB - Hindawi Publishing Corporation, New York
VL - 2003
IS - 39
SP - 2475
EP - 2486
LA - eng
UR - http://eudml.org/doc/50840
ER -