Maximum Entropy Analysis of Multiple-server Queueing Systems

DOI10.1057/jors.1989.144zbMath0677.90030OpenAlexW2003908522MaRDI QIDQ3833849

No author found.

Publication date: 1989

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1989.144

zbMATH Keywords

entropy maximizationmany serversapproximate formulaeGI/G/c queueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Measures of information, entropy (94A17)

Related Items (10)

An ME-based approximation for multi-server queues with preemptive priority ⋮ Approximations for multi-server queues: System interpolations ⋮ A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem ⋮ Steady-state probability of the randomized server control system with second optional service, server breakdowns and startup ⋮ Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle ⋮ On the optimal entropy analysis ⋮ A maximum entropy approach for the \(\langle p,N\rangle\)-policy \(M/G/1\) queue with a removable and unreliable server ⋮ Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times ⋮ Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with a removable server ⋮ Entropy maximisation and queueing network models

This page was built for publication: Maximum Entropy Analysis of Multiple-server Queueing Systems