| 1|pj~exp(λj)|E(wjDj)排序问题 |
| |
| 引用本文： | 王艳红,张文娟.1|pj~exp(λj)|E(wjDj)排序问题[J].河北科技大学学报,2008,29(4):286-288,298. |
| |
| 作者姓名： | 王艳红 张文娟 |
| |
| 作者单位： | 西安工业大学数理系,陕西西安,710032 |
| |
| 摘 要： | 为了能在多项式时间内解决随机排序问题,针对一类特殊的单机随机排序问题1|pj~exp(jλ)|E(∑wjDj)进行研究,分别从不可中断情形和可中断情形证明,得出由于指数分布的特性,该问题均有多项式最优算法,其最优算法为WSEPT规则。
|
| 关 键 词： | 随机排序 指数分布 优先策略 中断 |
| 收稿时间： | 2008/4/22 0:00:00 |
| 修稿时间： | 2008/6/28 0:00:00 |
1|pj～exp(λj)|E(∑wjDj) scheduling problems |
| |
| WANG Yan-hong and ZHANG Wen-juan.1|pj～exp(λj)|E(∑wjDj) scheduling problems[J].Journal of Hebei University of Science and Technology,2008,29(4):286-288,298. |
| |
| Authors: | WANG Yan-hong and ZHANG Wen-juan |
| |
| Affiliation: | WANG Yan-hong,ZHANG Wen-juan(Department of Mathematics , Physics,Xi\'an Technological University,Xi\'an Shaanxi 710032,China) |
| |
| Abstract: | In order to solve stochastic scheduling problems in polynomial time,we studied a class of single machine stochastic scheduling problems 1|pj~exp(λj)|E(∑wjDj).It is proved that because of the specific property of exponential distribution,the problems have polynomial optimal algorithms in both nonpreemptive and preemptive situation.Its optimal algorithm is WSEPT rule. |
| |
| Keywords: | stochastic schedule exponential distribution priority policy preemption |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《河北科技大学学报》浏览原始摘要信息 |
|
点击此处可从《河北科技大学学报》下载全文 |
|
