Comparative analysis for the \(N\) policy \(M/G/1\) queueing system with a removable and unreliable server

DOI10.1007/S001860400395zbMath1114.90025OpenAlexW1965333442MaRDI QIDQ2573780

Kuo-Hsiung Wang, Jau-Chuan Ke, Gang Chen, Li-Ping Wang

Publication date: 24 November 2005

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860400395

zbMATH Keywords

ControlSimulationMaximum entropyUnreliable server\(M/G(G)/1\) queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations ⋮ Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation ⋮ A maximum entropy approach for the \(\langle p,N\rangle\)-policy \(M/G/1\) queue with a removable and unreliable server ⋮ Mathematical analysis of queue with phase service: an overview ⋮ Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size

This page was built for publication: Comparative analysis for the \(N\) policy \(M/G/1\) queueing system with a removable and unreliable server