Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.
Allahverdi, Ali ; Aldowaisan, Tariq ; Sotskov, Yuri N.
International Journal of Mathematics and Mathematical Sciences, Tome 2003 (2003), p. 2475-2486 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2003-01-01
DOI : https://doi.org/10.1155/S016117120321019X
EUDML-ID : urn:eudml:doc:50840 
@article{02012552,
     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},
     volume = {2003},
     year = {2003},
     pages = {2475-2486},
     doi = {10.1155/S016117120321019X},
     zbl = {1041.90020},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02012552}
}

Allahverdi, Ali; Aldowaisan, Tariq; 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, Tome 2003 (2003) pp. 2475-2486. doi : 10.1155/S016117120321019X. http://gdmltest.u-ga.fr/item/02012552/