Maximizing throughput in finite-source parallel queue systems

DOI10.1016/J.EJOR.2011.09.041MaRDI QIDQ439422zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

queueingMarkov processesMarkov decision processesdispatching systemsrouting to parallel queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

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

• A survey of Markov decision models for control of networks of queues
• An assignment problem for a parallel queueing system with two heterogeneous servers
• Applying a New Device in the Optimization of Exponential Queuing Systems
• Control of a Heterogeneous Two-Server Exponential Queueing System
• Cost analysis of the M/M/R machine repair problem with balking, reneging, and server breakdowns
• Dynamic routing and jockeying controls in a two-station queueing system
• Fundamentals of queueing theory
• Minimizing response times and queue lengths in systems of parallel queues
• On the Assignment of Customers to Parallel Queues
• On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution
• On the Optimality of the Generalized Shortest Queue Policy
• On the optimal assignment of customers to parallel servers
• Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
• Optimal maintenance-repair policies for the machine repair problem
• Optimal policies for machine repairmen problems
• Optimal policies for scheduling repairs and allocating heterogeneous servers
• Optimality of the shortest line discipline
• \(N\) parallel queueing systems with server breakdown and repair

Cited in

(10)

• A linear model for surface mining haul truck allocation incorporating shovel idle probabilities
• Throughput maximization in a loss queueing system with heterogeneous servers
• Queueing models of parallel systems with simultaneous resource possession
• Server assignment policies for maximizing the steady-state throughput of finite queueing systems
• Minimizing response times and queue lengths in systems of parallel queues
• Allocation of flows in closed bipartite queueing networks
• Prioritized customer order scheduling to maximize throughput
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• Maximum values in queueing processes
• An overview for Markov decision processes in queues and networks

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)