摘要
讨论单机随机排序问题,目标函数为确定工件的排列顺序使工件的加权完工时间和的数学期望最小.设工件间的优先约束为有根森林,机器发生随机故障.对此情况,给出了多项式时间的最优算法.
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.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第24期112-119,共8页
Mathematics in Practice and Theory
基金
辽宁省教育厅科技研究项目资助(20060662)
关键词
排序
单机
随机故障
有根森林
优先约束
最优算法
scheduling
single machine
stochastic breakdowns
rooted forest
precedence constraints
optimal algorithm