工件加工随机调度中优先约束问题的研究

讨论工件加工时间为任意随机分布的随机变量的单机随机调度问题,设工件间的约束为树优先约束,目标函数为极小化加权完工时间和的数学期望.这一模型在机械设计与制造行业中的多个元器组件加工,以及钢铁板坯轧制等众多实际生产制造领域中都具有广泛的应用背景.证明了工件加工时间为任意随机分布的随机变量的情况下,最大家庭树中的工件优先于家庭树中其它的工件加工,并且其工件连续加工所得到的调度为最优调度,给出了最优多项式算法,该算法可以被推广应用于实际的生产中,具有较强的实际应用性.

Stochastic single machine scheduling problem with tree precedence constraints

The stochastic single-machine scheduling problem with stochastic processing times is considered. It is assumed that jobs are subject to tree precedence constraints,the objective function is to minimize the mean weighted sum of completion times. It has a widely applications in machine design and manufacturing field. Under the condition that stochastic processing times are taken into account,jobs in the maximal family tree should be processed prior to other jobs in family tree and the optimal schedule is obta...