| 时间期望错位限制下完工时间和的随机重新排序 |
| |
| 引用本文： | 刘园园,许小艳,郝赟,慕运动. 时间期望错位限制下完工时间和的随机重新排序[J]. 河南科学, 2012, 30(7): 828-831 |
| |
| 作者姓名： | 刘园园 许小艳 郝赟 慕运动 |
| |
| 作者单位： | 河南工业大学理学院,郑州,450001 |
| |
| 基金项目： | 河南省自然科学基金NSFHN,河南省教育厅自然科学基金,河南工业大学博士科研基金和河南工业大学研究生科技创新基金项目的资助 |
| |
| 摘 要： | 讨论了工件加工时间服从任意分布,在时间期望错位下的随机重新排序问题,目标是使期望总完工时间最小.根据理论分析的方法,研究了工件的最优加工顺序.结果表明最短期望加工时间优先规则是使目标达到最小的策略,并由该策略得出多项式时间算法或拟多项式时间算法.
|
| 关 键 词： | 随机排序 重新排序 时间错位期望值 任意分布 |
Stochastic Rescheduling Problem of Total Completed Time under Expected Time Disruption |
| |
| Liu Yuanyuan , Xu Xiaoyan , Hao Yun , Mu Yundong. Stochastic Rescheduling Problem of Total Completed Time under Expected Time Disruption[J]. Henan Science, 2012, 30(7): 828-831 |
| |
| Authors: | Liu Yuanyuan Xu Xiaoyan Hao Yun Mu Yundong |
| |
| Affiliation: | (College of Science,Henan University of Technology,Zhengzhou 450001,China) |
| |
| Abstract: | The stochastic rescheduling problem with the processing time from arbitrary distribution under expected time disruption is considered and researched,and the objective is to minimize the expected total completed time.According to theoretical analysis method,we study optimal order of job.The result show that Shortest Expected Processing Time First Rule can minimize the objective,and give polynomial time algorithm and pseudo-polynomial time algorithm. |
| |
| Keywords: | stochastic scheduling rescheduling expected time disruption arbitrary distribution |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
