Optimal control of single-server queueing networks

DOI10.1007/BF01414156zbMath0772.60067MaRDI QIDQ5286756

Jürgen Roland Weishaupt, Svend-Holger Friis, Ulrich Rieder

Publication date: 23 August 1993

Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingopen bandit processeslargest-index policieslargest-remaining-index methodsingle-server queueing network model

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Optimal myopic policies and index policies for stochastic scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arm-acquiring bandits
• Multiple feedback at a single-server station
• Branching Bandit Processes
• Extensions of the multiarmed bandit problem: The discounted case
• A lemma on the multiarmed bandit problem
• The Multi-Armed Bandit Problem: Decomposition and Computation
• Open bandit processes and optimal scheduling of queueing networks
• OPTIMAL JOB SCHEDULING OF M/GI/1 QUEUE WITH FEEDBACK: THE DISCOUNTED CASE
• A Priority Queue with Discounted Linear Costs
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback

This page was built for publication: Optimal control of single-server queueing networks