Stochastic flowshop no-wait scheduling
Keyword(s):
No Wait
◽
This paper deals with special cases of stochastic flowshop, no-wait, scheduling. n jobs have to be processed by m machines . The processing time of job Ji on machine Mj is an independent random variable Ti . It is possible to sequence the jobs so that , . At time 0 the realizations of the random variables Ti , ( i are known. For m (m ≧ 2) machines it is proved that a special SEPT–LEPT sequence minimizes the expected schedule length; for two (m = 2) machines it is proved that the SEPT sequence minimizes the expected sum of completion times.
2012 ◽
Vol 44
(3)
◽
pp. 842-873
◽
Keyword(s):
1979 ◽
Vol 86
(2)
◽
pp. 301-312
◽
2012 ◽
Vol 44
(03)
◽
pp. 842-873
◽
Keyword(s):
1991 ◽
Vol 5
(3)
◽
pp. 333-348
◽
1982 ◽
Vol 29
(3)
◽
pp. 495-504
◽