Dynamic routing to heterogeneous collections of unreliable servers

DOI10.1007/S11134-006-9002-9zbMath1166.90328OpenAlexW2083879805MaRDI QIDQ2641948

Yanyan Li

Publication date: 17 August 2007

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

Full work available at URL: https://doi.org/10.1007/s11134-006-9002-9

zbMATH Keywords

Lagrangian relaxationdynamic programmingsemi-Markov decision processdynamic routingmachine breakdownsindex policypolicy improvement

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Queues and service in operations research (90B22) Dynamic programming (90C39)

Related Items (2)

An Analysis Method of Queueing Networks with a Degradable Structure and Non-zero Repair Times of Systems ⋮ General notions of indexability for queueing control and asset management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality of routing and servicing in dependent parallel processing systems
• Whittle's index policy for a multi-class queueing system with convex holding costs
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Index policies for the routing of background jobs
• On the Optimality of the Generalized Shortest Queue Policy
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
• Minimizing response times and queue lengths in systems of parallel queues

This page was built for publication: Dynamic routing to heterogeneous collections of unreliable servers