The Distributional Little's Law and Its Applications
From MaRDI portal
Publication:4849330
DOI10.1287/opre.43.2.298zbMath0837.90048OpenAlexW2059024810WikidataQ55969789 ScholiaQ55969789MaRDI QIDQ4849330
Daisuke Nakazato, Dimitris J. Bertsimas
Publication date: 25 September 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.2.298
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (16)
ON THE VARIANCES OF SYSTEM SIZE AND SOJOURN TIME IN A DISCRETE-TIME DAR(1)/D/1 QUEUE ⋮ Palm calculus for a process with a stationary random measure and its applications to fluid queues ⋮ M/M/c Queue with Two Priority Classes ⋮ Mean-Field Limits for Large-Scale Random-Access Networks ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ The impact of production time variability on make-to-stock queue performance ⋮ A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues ⋮ Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue ⋮ A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application ⋮ Delay and partial system contents for a discrete-time G-D-c queue ⋮ On the large deviations behavior of acyclic networks of \(G/G/1\) queues ⋮ Service with a queue and a random capacity cart: random processing batches and E-limited policies ⋮ A review of \(L=\lambda W\) and extensions ⋮ Multi-server queueing systems with multiple priority classes ⋮ State-dependent \(\mathrm{M}/\mathrm{G}/1\) queueing systems ⋮ Allocation of service time in a two-server system
This page was built for publication: The Distributional Little's Law and Its Applications
