Fluid models of parallel service systems under FCFS
From MaRDI portal
Publication:5080673
DOI10.1287/OPRE.2021.2102zbMATH Open1490.90096arXiv1604.04497OpenAlexW3196476520MaRDI QIDQ5080673FDOQ5080673
Authors: Yuval Nov, Gideon Weiss, Hanqin Zhang 
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Abstract: We study deterministic fluid approximations of parallel service systems operating under first come first served policy (FCFS). The condition for complete resource pooling is identified in terms of the system structure and the customer service times. The static planning linear programming approach (Harrison and Lopez cite{harrison-lopez:99}) is used to obtain a maximum throughput compatibility tree and to show that FCFS using this compatibility tree is throughput optimal. We investigate matching rates and show by Hotelling's -test and simulation that they are dependent on the service time distribution.
Full work available at URL: https://arxiv.org/abs/1604.04497
Recommendations
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Design heuristic for parallel many server systems
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
- Stability of parallel queueing systems with coupled service rates
stochastic modelsresource poolingfirst come first servedmatching ratesparallel service systemsdeterministic fluid approximation
Queues and service in operations research (90B22) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Markov chains and stochastic stability
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Some Useful Functions for Functional Limit Theorems
- Title not available (Why is that?)
- Stability and Instability of Fluid Models for Reentrant Lines
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Control Techniques for Complex Networks
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Instability of FIFO queueing networks
- Queue-and-idleness-ratio controls in many-server service systems
- Heavy traffic resource pooling in parallel-server systems
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- A product form solution to a system with multi-type jobs and multi-type servers
- Stability of queueing networks
- Service-level differentiation in many-server service systems via queue-ratio routing
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Dynamic scheduling of a two-server parallel server system with complete resource pooling and reneging in heavy traffic: asymptotic optimality of a two-threshold policy
- Dynamic control of a make-to-order, parallel-server system with cancellations
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Stability of the stochastic matching model
- On the stability of a partially accessible multi-station queue with state-dependent routing
- A broader view of Brownian networks
- Stability and instability of a two-station queueing network
- A fluid limit model criterion for instability of multiclass queueing networks
- Exact FCFS matching rates for two infinite multitype sequences
- Dynamic control of \(N\)-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Maximum Pressure Policies in Stochastic Processing Networks
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- On dynamic scheduling of a parallel server system with complete resource pooling
- The non-ergodic Jackson network
- Near optimal control of queueing networks over a finite time horizon
- A Queueing System with General-Use and Limited-Use Servers
- Dynamic Scheduling of a Four-Station Queueing Network
- Stability analysis of N-model systems under a static priority rule
- Reversibility and further properties of FCFS infinite bipartite matching
- On the instability of matching queues
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Design heuristic for parallel many server systems
- Local stability in a transient Markov chain
- Stabilizing policies for probabilistic matching systems
- Fluid and diffusion approximations of probabilistic matching systems
Cited In (6)
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Design heuristic for parallel many server systems
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Applications of fluid models in service operations management
- Fluid and diffusion approximations of probabilistic matching systems
- Many-server scaling of the N-system under FCFS-ALIS
This page was built for publication: Fluid models of parallel service systems under FCFS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080673)
