Fluid models of parallel service systems under FCFS
From MaRDI portal
Publication:5080673
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.
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
Cites work
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- A Queueing System with General-Use and Limited-Use Servers
- A broader view of Brownian networks
- A fluid limit model criterion for instability of multiclass queueing networks
- A product form solution to a system with multi-type jobs and multi-type servers
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Control Techniques for Complex Networks
- Design heuristic for parallel many server systems
- Dynamic Scheduling of a Four-Station Queueing Network
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic control of \(N\)-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Dynamic control of a make-to-order, parallel-server system with cancellations
- 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
- Exact FCFS matching rates for two infinite multitype sequences
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Fluid and diffusion approximations of probabilistic matching systems
- Heavy traffic resource pooling in parallel-server systems
- Instability of FIFO queueing networks
- Local stability in a transient Markov chain
- Markov chains and stochastic stability
- Maximum Pressure Policies in Stochastic Processing Networks
- Near optimal control of queueing networks over a finite time horizon
- Network flows. Theory, algorithms, and applications.
- On dynamic scheduling of a parallel server system with complete resource pooling
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- On the instability of matching queues
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Queue-and-idleness-ratio controls in many-server service systems
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Reversibility and further properties of FCFS infinite bipartite matching
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Service-level differentiation in many-server service systems via queue-ratio routing
- Some Useful Functions for Functional Limit Theorems
- Stability analysis of N-model systems under a static priority rule
- Stability and Instability of Fluid Models for Reentrant Lines
- Stability and instability of a two-station queueing network
- Stability of queueing networks
- Stability of the stochastic matching model
- Stabilizing policies for probabilistic matching systems
- The non-ergodic Jackson network
Cited in
(7)- 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
- Design heuristic for parallel many server systems
- A fluid approximation for a matching model with general reneging distributions
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
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)
