Stochastic flowshop no-wait scheduling
Copyright policy )Stochastic flowshop no-wait scheduling
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.
Applications of mathematical programming, Deterministic scheduling theory in operations research, stochastic scheduling, stochastic flowshop, no-wait, scheduling, expected sum of completion times, Stochastic programming
Applications of mathematical programming, Deterministic scheduling theory in operations research, stochastic scheduling, stochastic flowshop, no-wait, scheduling, expected sum of completion times, Stochastic programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!