任务到达时间服从泊松分布的随机排序  

Stochastic Scheduling Problems of Releases Times Obeying Poisson Distribution

作　　者：王艳红[1] 李蕊[1] 张文娟[1] 

机构地区：[1]西安工业大学理学院,西安710021

出　　处：《西安工业大学学报》2016年第1期5-7,共3页Journal of Xi’an Technological University

基　　金：陕西省教育厅项目(15JK1371)

摘　　要：研究在多项式时间内任务到达时间服从泊松分布的随机排序,描述了一类特殊的单机随机排序问题,文中基于任务到达时间服从泊松分布,给出了该问题的多项式最优算法,证明得出在不可中断动态策略下有最优解,最短期望加工时间优先规则为其多项式最优算法.A class of single machine stochastic scheduling problems with the releases times obeying Poisson distribution are discussed in this paper to solve the stochastic scheduling problems in polynomial time. Based on the specific property of Poisson distribution, the polynomial optimal algorithm is presented. It is proved that the optimal algorithm is the rule of weighted shortest expected processing time first under the nonpreemptive dynamic policy.

关 键 词：随机排序 到达时间 泊松分布 多项式最优算法 

分 类 号：O223[理学—运筹学与控制论]