Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
From MaRDI portal
Publication:1992143
DOI10.1007/s11134-018-9578-xzbMath1408.60090OpenAlexW2795103573MaRDI QIDQ1992143
Noa Zychlinski, Petar Momčilović, Avishai Mandelbaum
Publication date: 2 November 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-018-9578-x
reflectionfluid modelsfunctional strong law of large numbersflow lines with blockingtandem queueing networks with blockingtime-varying queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Applications of fluid models in service operations management ⋮ A broad view of queueing theory through one issue ⋮ Time-varying many-server finite-queues in tandem: comparing blocking mechanisms via fluid models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue
- Large-time asymptotics for the \(G_{t}/M_{t}/s_{t}+GI_{t}\) many-server fluid queue with abandonment
- Blocking, reordering, and the throughput of a series of servers
- Heavy-traffic limits for many-server queues with service interruptions
- Efficient simulation of non-Poisson non-stationary point processes to study queueing approximations
- An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
- Departures from many queues in series
- Manufacturing flow line systems: A review of models and analytical results
- Strong approximation for Markovian service networks
- State-dependent stochastic networks. I: Approximation and applications with continuous diffusion limits
- A survey of product form queueing networks with blocking and their equivalences
- Exact solutions for networks of queues with blocking-after-service
- Throughput estimation in cyclic queueing networks with blocking
- Large tandem queueing networks with blocking
- A many-server fluid limit for the \(G_t/GI/s_t +GI\) queueing model experiencing periods of overloading
- Many-server heavy-traffic limit for queues with time-varying parameters
- Two fluid approximations for multi-server queues with abandonments
- Performance analysis of multi-server tandem queues with finite buffers and blocking
- Stochastic-Process Limits
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- On the waiting time of a two-stage queueing system with blocking
- A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment
- Fluid Models for Multiserver Queues with Abandonments
- What you should know about queueing models to set staffing requirements in service systems
- A Fluid Flow Model of Networks of Queues
- The Best Order for Queues in Series
- A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands
- An Approximation Method for Tandem Queues with Blocking
- An Approximation Method for Open Restricted Queueing Networks
- Asymptotic Behavior of the Number of Free Servers for Systems with Refusals
- Simulation run lengths to estimate blocking probabilities
- A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited
- On the Generalized Drift Skorokhod Problem in One Dimension
- Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
- Assembly-like queues
- Mt/G/∞ Queues with Sinusoidal Arrival Rates
- NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS
- STAFFING TO STABILIZE BLOCKING IN LOSS MODELS WITH TIME-VARYING ARRIVAL RATES
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
- Transient Behaviour of a Tandem Queue
- A Sequence of Service Stations with Arbitrary Input and Regular Service Times
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- A Sequence of Two Servers with No Intermediate Queue
- An analytical solution for a tandem queue with blocking
- Analysis of queueing networks with blocking
