Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
2003 ◽
Vol 2003
(39)
◽
pp. 2475-2486
◽
Keyword(s):
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.
2007 ◽
Vol 1
(2)
◽
pp. 5-23
◽
2006 ◽
Vol 169
(3)
◽
pp. 767-780
◽
2017 ◽
Vol 88
◽
pp. 237-246
◽
2004 ◽
Vol 55
(3)
◽
pp. 277-286
◽
2004 ◽
Vol 47
(2-3)
◽
pp. 181-193
◽
2022 ◽
Vol 13
(1)
◽
pp. 43-50
◽