【摘要】 讨论单机随机排序问题,目标函数为确定工件的排列顺序使工件的加权完工时间和的数学期望最小.设工件间的优先约束为有根森林,机器发生随机故障.对此情况,给出了多项式时间的最优算法.更多还原

【Abstract】 The stochastic single machine scheduling problem was considered in order to determine job schedule that minimizes the mean weighted sum of completion times.It is assumed that job is subject to rooted forest precedence constraints and the machine is subject to a sequence of stochastic breakdowns.For the case,the polynomial-time optimal algorithm is presented.更多还原