Maximizing throughput in finite-source parallel queue systems
From MaRDI portal
Publication:439422
DOI10.1016/J.EJOR.2011.09.041zbMATH Open1244.90239OpenAlexW2107927314MaRDI QIDQ439422FDOQ439422
Authors: Mohammad Delasay, Bora Kolfal, Armann Ingolfsson 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.041
Recommendations
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- Throughput maximization in a loss queueing system with heterogeneous servers
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
- On the Assignment of Customers to Parallel Queues
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
Cites Work
- Fundamentals of queueing theory
- A survey of Markov decision models for control of networks of queues
- Cost analysis of the M/M/R machine repair problem with balking, reneging, and server breakdowns
- On the optimal assignment of customers to parallel servers
- On the Assignment of Customers to Parallel Queues
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Optimality of the shortest line discipline
- On the Optimality of the Generalized Shortest Queue Policy
- \(N\) parallel queueing systems with server breakdown and repair
- Optimal policies for machine repairmen problems
- Minimizing response times and queue lengths in systems of parallel queues
- An assignment problem for a parallel queueing system with two heterogeneous servers
- Control of a Heterogeneous Two-Server Exponential Queueing System
- Optimal maintenance-repair policies for the machine repair problem
- Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
- On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution
- Dynamic routing and jockeying controls in a two-station queueing system
- Optimal policies for scheduling repairs and allocating heterogeneous servers
Cited In (10)
- Throughput maximization in a loss queueing system with heterogeneous servers
- Queueing models of parallel systems with simultaneous resource possession
- Queueing dynamics and maximal throughput scheduling in switched processing systems
- Allocation of flows in closed bipartite queueing networks
- Prioritized customer order scheduling to maximize throughput
- Maximum values in queueing processes
- Minimizing response times and queue lengths in systems of parallel queues
- An overview for Markov decision processes in queues and networks
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- A linear model for surface mining haul truck allocation incorporating shovel idle probabilities
This page was built for publication: Maximizing throughput in finite-source parallel queue systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439422)
