检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Le Luo Ying-Hui Tang Miao-Miao Yu Wen-Qing Wu
机构地区:[1]School of Mathematical Sciences,Sichuan Normal University,Chengdu,610068,Sichuan,China [2]Nanchong Vocational and Technical College,Nanchong,637000,Jiangsu,China [3]Visual Computing and Virtual Reality Key Laboratory of Sichuan Province,Sichuan Normal University,Chengdu,610068,Sichuan,China
出 处:《Journal of the Operations Research Society of China》2023年第4期857-874,共18页中国运筹学会会刊(英文)
基 金:supported by the National Natural Science Foundation of China(No.71571127);the National Natural Science Youth Foundation of China(No.72001181).
摘 要:Based on the number of customers and the server’s workload,this paper proposes a modified Min(N,D)-policy and discusses an M/G/1 queueing model with delayed randomized multiple vacations under such a policy.Applying the well-known stochastic decomposition property of the steady-state queue size,the probability generating function of the steady-state queue length distribution is obtained.Moreover,the explicit expressions of the expected queue length and the additional queue length distribution are derived by some algebraic manipulations.Finally,employing the renewal reward theorem,the explicit expression of the long-run expected cost per unit time is given.Furthermore,we analyze the optimal policy for economizing the expected cost and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy by using numerical examples.
关 键 词:M/G/1 queue Modified Min(N D)-policy Randomized multiple vacations Queue length generating function Optimal joint control policy
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43