| 有根森林优先约束的单机随机排序问题 |
| |
| 引用本文： | 高文军,王吉波,单锋,林琳.有根森林优先约束的单机随机排序问题[J].数学的实践与认识,2008,38(24). |
| |
| 作者姓名： | 高文军 王吉波 单锋 林琳 |
| |
| 作者单位： | 沈阳航空工业学院理学系,沈阳,110136 |
| |
| 基金项目： | 辽宁省教育厅科技研究项目资助
|
| |
| 摘 要： | 讨论单机随机排序问题,目标函数为确定工件的排列顺序使工件的加权完工时间和的数学期望最小.设工件间的优先约束为有根森林,机器发生随机故障.对此情况,给出了多项式时间的最优算法.
|
| 关 键 词： | 排序 单机 随机故障 有根森林 优先约束 最优算法 |
Stochastic Single Machine Scheduling with Rooted Forest Precedence Constraints |
| |
| GAO Wen-jun,WANG Ji-bo,SHAN Feng,LIN Lin.Stochastic Single Machine Scheduling with Rooted Forest Precedence Constraints[J].Mathematics in Practice and Theory,2008,38(24). |
| |
| Authors: | GAO Wen-jun WANG Ji-bo SHAN Feng LIN Lin |
| |
| Institution: | Department of Science;Shenyang Institute of Aeronautical Engineering;Shenyang 110136;China |
| |
| 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. |
| |
| Keywords: | scheduling single machine stochastic breakdowns rooted forest precedence constraints optimal algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
