A review of L= W and extensions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3899912 (Why is no real title available?)
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 3793743 (Why is no real title available?)
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- scientific article; zbMATH DE number 3599479 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- scientific article; zbMATH DE number 3203805 (Why is no real title available?)
- scientific article; zbMATH DE number 3408614 (Why is no real title available?)
- scientific article; zbMATH DE number 3408679 (Why is no real title available?)
- L = λW: A Discounted Analogue and a New Proof
- A Generalization of L = λW to Moments of Queue Length and Waiting Times
- A Note on a Sample-Path Rate Conservation Law and its Relationship withH=λG
- A Proof for the Queuing Formula: L = λW
- A Simple Proof of: L = λW
- A Survey of J. Little's Formula
- A central-limit-theorem version of \(L=\lambda W\)
- A distributional form of Little's law
- A formal approach to queueing processes in the steady state and their applications
- A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
- A relation between stationary queue and waiting time distributions
- An LIL Version of L = λW
- An elementary proof of Sengupta's invariance relation and a remark on Miyazawa's conservation principle
- An extremal property of the fifo discipline via an ordinal version of
- Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
- Conservation Equations and Variance Reduction in Queueing Simulations
- Continuous versions of the queuing formulas L=lambdaW and H=lambdaG
- EPSTA: The coincidence of time-stationary and customer-stationary distributions
- Efficient Estimators for Simulated Queueing Systems
- Einige Anwendungen der Theorie zufälliger Punktprozesse in der Bedienungstheorie I
- Estimating Average Production Intervals Using Inventory Measurements: Little's Law for Partially Observable Processes
- Event and time averages: a review
- Extensions of the Queueing Relations L = λW and H = λG
- Hierarchical Production Planning: A Two-Stage System
- Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes
- Indirect Estimation Via L = λW
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- On Arrivals That See Time Averages
- On rate conservation for non-stationary processes
- On the Optimality of Single-Server Queuing Systems
- On the relation between customer and time averages in queues
- On up- and downcrossings
- Ordinary CLT and WLLN Versions of L = λW
- Rate conservation for stationary processes
- Regenerative processes in the theory of queues, with applications to the alternating-priority queue
- Sample path analysis of level crossings for the workload process
- Sample-path analysis of processes with imbedded point processes
- Sample-path derivations of the excess, age, and spread distributions
- Stationary random processes associated with point processes
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- Technical Note—A Last Word on L = λW
- The Asymptotic Efficiency of Simulation Estimators
- The Distributional Little's Law and Its Applications
- The Relation between Customer and Time Averages in Queues
- The System Point Method in Exponential Queues: A Level Crossing Approach
- The derivation of invariance relations in complex queueing systems with stationary inputs
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- The intensity conservation law for queues with randomly changed service rate
- Time and customer processes in queues with stationary inputs
Cited in
(39)- On a direct estimator for average production intervals
- Little's law when the average waiting time is infinite
- Sample-path analysis of general arrival queueing systems with constant amount of work for all customers
- Performance analysis and buffer allocations in some open assembly systems.
- Correction note on \(L={\lambda{}}W\)
- Performance measures of nonstationary inventory models for perishable products under the EWA policy
- Periodic Little's law
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- A central-limit-theorem version of the periodic Little's law
- On pathwise behavior of queues
- Sample-path analysis of stochastic discrete-event systems
- On applications of Little's formula
- Travel times in queueing networks and network sojourns
- Stabilizing performance in a single-server queue with time-varying arrival rate
- Rate conservation laws: A survey
- Little's Law as viewed on its 50th anniversary
- A Survey of J. Little's Formula
- Waiting time estimation in a manufacturing system using the number of machine idle periods
- Controlled mobility in stochastic and dynamic wireless networks
- Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
- Multi-server queueing systems with multiple priority classes
- Continuous polling models and application to ferry assisted WLAN
- A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws
- Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- A note on the discretization of Little's result
- A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
- Constraints on fluctuations in sparsely characterized biological systems
- A robust queueing network analyzer based on indices of dispersion
- Delay and partial system contents for a discrete-time G-D-c queue
- Extending the FCLT version of \(L=\lambda W\)
- Sample path analysis of contribution and reward in cooperative groups
- Boundary driven zero-range processes in random media
- Relating the waiting time in a heavy-traffic queueing system to the queue length
- Little laws for utility processes and waiting times in queues
- An examination of some factory physics principles
- 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
- ESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE'S LAW
This page was built for publication: A review of \(L=\lambda W\) and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803674)
