摘要
本文讨论了２－机器ＦｌｏｗＳｈｏｐ调度问题，在假定同一工件在不同机器上的加工时间为同分布的随机变量且加工时间在随机意义下可以排序时，给出了等待时间差的绝对值总和的期望最小的最优排序的若干性质。
We consider the problem of scheduling n jobs on a 2-machine flow shop. Under the assumption that the processing times of a job on different machines are identical distributed random variables, several properties of optimal sequence for minimizing the expected variation of waiting time on each machine are established when jobs can be ordered in some stochastic meaning.
出处
《南开大学学报（自然科学版）》
CAS
CSCD
1996年第2期37-44,109,共9页
Acta Scientiarum Naturalium Universitatis Nankaiensis
关键词
调度
随机排序
排序
scheduling
stochastic ordering
flow shop
