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. (English) Zbl 1041.90020 Int. J. Math. Math. Sci. 2003, No. 39, 2475-2486 (2003). Summary: This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given. Cited in 15 Documents MSC: 90B36 Stochastic scheduling theory in operations research 90B30 Production models PDFBibTeX XMLCite \textit{A. Allahverdi} et al., Int. J. Math. Math. Sci. 2003, No. 39, 2475--2486 (2003; Zbl 1041.90020) Full Text: DOI EuDML