✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Customer who find the total number of busy and failed servers equal to $s$,i.e, he is given to choice to enter a retrial orbit for an random amount of time before attempting to
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:This paper concerns an approximate analysis of a Markovian multiserver infinite source retrial queuing with impatience, in which all the servers are subject to breakdown andrepairs.
📊
Temel Bulgular & Veri:This paper concerns an approximate analysis of a Markovian multiserver infinite source retrial queuing with impatience, in which all the servers are subject to breakdown andrepairs.
💡
Sonuç & Katkı:Customer who find the total number of busy and failed servers equal to $s$,i.e, he is given to choice to enter a retrial orbit for an random amount of time before attempting to
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Retrial queue · Multi server · Impatient
Abstract
This paper concerns an approximate analysis of a Markovian multiserver infinite source retrial queuing with impatience, in which all the servers are subject to breakdown andrepairs. Customer who find the total number of busy and failed servers equal to $s$,i.e, he is given to choice to enter a retrial orbit for an random amount of time before attempting to
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
ELHADDAD, M., BELARBI, F. L. (2019). On the Analysis of Unreliable Markovian Multiserver Queue with Retrials and Impatience. Mathematical Sciences and Applications E-Notes, Cilt: 7 - Sayı: 2, 205–217. https://ajindex.com/articles/283478