Entropy maximization for the busy period of a single server queue

被引：0
|
作者：
Bounkhel, Messaoud [1 ]
Tadj, Lotfi [2 ]
Hedjar, Ramdane [3 ]
机构：
[1] King Saud Univ, Dept Math, Riyadh 11451, Saudi Arabia
[2] Alfaisal Univ, Dept Ind Engn, Riyadh, Saudi Arabia
[3] King Saud Univ, Dept Comp Engn, Riyadh, Saudi Arabia
来源：
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS | 2023年 / 52卷 / 23期
关键词：
Unreliable server; two-phase service; Bernoulli vacation schedule; setup time; N-policy; delaying repair; busy period; maximum entropy; N-POLICY; SYSTEM;
D O I：
10.1080/03610926.2022.2065301
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
This article applies the maximum entropy principle to determine the probability density function of the delayed busy period in an M/G/1 type queueing system with setup time, two phases of service, Bernoulli vacation, N-policy, and server breakdowns. Numerical illustrations show that the accuracy of the estimated probability density function depends on the type of information fed to the method.
引用
收藏
页码：8555 / 8565
页数：11
相关论文
共 50 条
12345