Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement

DOI10.1007/s11134-021-09713-yzbMath1483.60131arXiv1803.10688OpenAlexW3206614681MaRDI QIDQ2070675

Olivier Bilenne

Publication date: 24 January 2022

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.10688

zbMATH Keywords

\(M/G/1\) queuePoisson equationpolicy iterationdispatchingfirst-policy improvement

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

poisson

Uses Software

• MCQueue
• GitHub

Cites Work

• Size- and state-aware dispatching problem with queue-specific job sizes
• Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
• On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions
• On the Lambert \(w\) function
• Theory of probability and random processes.
• Potentiel markovien récurrent des chaînes de Harris. (Recurrent Markov potential of Harris chains)
• A Liapounov bound for solutions of the Poisson equation
• Transform-Domain Solutions of Poisson’s Equation with Applications to the Asymptotic Variance
• On the value function of the M/Cox(r)/1 queue
• Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
• On the Poisson equation in the potential theory of a single kernel.
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Poisson's equation for the recurrent M/G/1 queue
• A heuristic rule for routing customers to parallel servers
• The policy iteration algorithm for average reward Markov decision processes with general state space
• Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
• On the Value Function of the M/G/1 FCFS and LCFS Queues
• On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
• Neuro-Dynamic Programming: An Overview and Recent Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement