OPTIMALITY OF TRUNK RESERVATION FOR AN M/M/K/N QUEUE WITH SEVERAL CUSTOMER TYPES AND HOLDING COSTS
From MaRDI portal
Publication:2884253
DOI10.1017/S0269964811000179zbMath1254.90044MaRDI QIDQ2884253
Fenghsu Yang, Eugene A. Feinberg
Publication date: 24 May 2012
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Markov decision processtrunk reservationcustomer classesstationary optimal policyaverage rewardsbias optimal policy\(M/M/k/N\)Blackwell optimal policiescanonical optimal policy
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Related Items
OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES ⋮ On the optimality of a maintenance queueing system ⋮ Bias optimality of admission control in a non-stationary repairable queue ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Optimality of admission control in a repairable queue ⋮ Optimality of admission control in an M∕M∕1∕N queue with varying services ⋮ Optimal pricing for a \(\mathrm{GI}/\mathrm{M}/k/N\) queue with several customer types and holding costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal control of arrivals to multiserver queues in a random environment
- OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS
- Optimal control of admission to a quenching system
- On Homogeneous Markov Models with Continuous Time and Finite or Countable State Space
- Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue
- Bias Optimality in Controlled Queueing Systems
- BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL
- Discrete Dynamic Programming
- Optimality of randomized trunk reservation for a problem with a single constraint
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- The Regulation of Queue Size by Levying Tolls
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
- Customers' Optimal Joining Rules for the GI/M/s Queue
- Individual and Social Optimization in a Multiserver Queue with a General Cost-Benefit Structure