Approximating queue lengths in M(t)/D/1 queues
From MaRDI portal
Recommendations
- Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle
- A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
- Maximum Entropy Analysis of Multiple-server Queueing Systems
- Approximation of periodic queues
- Continuous approximation of \(M_t/M_t/ 1\) distributions with application to production
Cites work
- Information theoretic approximations for M/G/1 and G/G/1 queuing systems
- Maximum Entropy Condition in Queueing Theory
- Nonstationary queuing probabilities for landing congestion of aircraft
- The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution
Cited in
(9)- scientific article; zbMATH DE number 4159820 (Why is no real title available?)
- Information theoretic approximations for the \(M/G/1\) retrial queue
- Practical methods for queue length behaviour for bulk service queues of the form \(M/G^{0,C}/1\) and \(M(t)/G^{0,C}/1\)
- scientific article; zbMATH DE number 4104149 (Why is no real title available?)
- scientific article; zbMATH DE number 5593401 (Why is no real title available?)
- The optimal batch size of \(M/D^N/1\) queue
- Uniform approximations for the \(M/G/1\) queue with subexponential processing times
- NEGATIVE PROBABILITIES AT WORK IN THE M/D/1 QUEUE
- Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle
This page was built for publication: Approximating queue lengths in M(t)/D/1 queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263888)