Approximating queue lengths in M(t)/D/1 queues
From MaRDI portal
Publication:1263888
DOI10.1016/0377-2217(90)90314-2zbMath0688.60072OpenAlexW1979643455MaRDI QIDQ1263888
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90314-2
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Information theoretic approximations for the \(M/G/1\) retrial queue ⋮ Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle
Cites Work
- Information theoretic approximations for M/G/1 and G/G/1 queuing systems
- Maximum Entropy Condition in Queueing Theory
- The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution
- Nonstationary Queuing Probabilities for Landing Congestion of Aircraft
This page was built for publication: Approximating queue lengths in M(t)/D/1 queues
