| 序列错位下完工时间和的随机重新排序问题 |
| |
| 引用本文： | 慕运动,郝赟.序列错位下完工时间和的随机重新排序问题[J].河南科学,2011,29(10):1145-1147. |
| |
| 作者姓名： | 慕运动 郝赟 |
| |
| 作者单位： | 河南工业大学理学院,郑州,450001 |
| |
| 基金项目： | 河南省自然科学基金NSFHN(112300410078); 河南省教育厅自然科学基金(2011B110008); 河南工业大学研究生科技创新基金(10ZJS056);河南工业大学博士科研基金的资助 |
| |
| 摘 要： | 讨论了工件加工时间服从任意分布的随机重新排序问题,目标是使期望总完工时间最小.根据理论分析的方法,研究了工件的最优加工顺序.结果表明最短期望加工时间优先规则是使目标达到最小的策略,并由该策略得出多项式时间算法.
|
| 关 键 词： | 随机排序 重新排序 序列错位 任意分布 |
Stochastic Rescheduling Problem with Total Completed Time under Sequence Disruption |
| |
| Mu Yundong,Hao Yun.Stochastic Rescheduling Problem with Total Completed Time under Sequence Disruption[J].Henan Science,2011,29(10):1145-1147. |
| |
| Authors: | Mu Yundong Hao Yun |
| |
| Institution: | Mu Yundong,Hao Yun (Department of Mathematics and Physics,Henan University of Technology,Zhengzhou 450001,China) |
| |
| Abstract: | The stochastic rescheduling problem with the processing time from arbitrary distribution were considered,and the objective is to minimize the expected of total completion time,according to theoretical analysis method,we study optimal order of job.The result show that Shortest Expected Processing Time First rule is policy that to minimize objective,and given polynomial time algorithm. |
| |
| Keywords: | stochastic scheduling rescheduling sequence disruption arbitrary distribution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
