计算机与数字工程2024，Vol.52Issue(2)：403-405,422,4.DOI:10.3969/j.issn.1672-9722.2024.02.019
到达时间服从泊松分布的平行机队列的最优随机排序问题
Optimal Stochastic Scheduling in Multiclass Parallel Queues of Poisson Arrivals
摘要
Abstract
This paper considers the problem of scheduling different classes of customers on multiple distributed servers to min-imize an objective function based on per-class mean processing times.This problem arises in a wide range of distributed systems,networks and applications.Within the context of this model,it observes that the optimal sequencing strategy at each of the servers is a simple static priority policy.Using this observation,it argues that the globally optimal scheduling problem reduces to finding an op-timal routing matrix under this sequencing policy.It formulates the latter problem as a nonlinear programming problem and show that any interior local minimum is a global minimum,which significantly simplifies the solution of the optimization problem.In the case of poisson arrivals,this paper provides an optimal scheduling strategy that also tends to minimize a function of the per-class re-sponse time variances.Applying this analysis to various static instances of the general problem leads to rederive many results,yield-ing simple approximation algorithms whose guarantees match the best known results.关键词
泊松分布/随机排序/静态优先策略/非线性规划Key words
poisson distribution/stochastic scheduling/static priority policy/nonlinear programming problem分类
数理科学引用本文复制引用
王艳红,雷松泽,张文娟,李蕊..到达时间服从泊松分布的平行机队列的最优随机排序问题[J].计算机与数字工程,2024,52(2):403-405,422,4.基金项目
2021年陕西省科技厅面上项目(编号:2021JM-440)资助. （编号:2021JM-440）
