Optimal control for entry of many classes of customers to an M/M/1 queue

✍ Scribed by Robert C. Rue; Matthew Rosenshine

• Publisher: John Wiley and Sons
• Year: 1981
• Tongue: English
• Weight: 449 KB
• Volume: 28
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800280312

✦ Synopsis

Abstract

A method is developed for determining the optimal policy for entry of customers from many independent classes of Poisson arrivals to a first‐come, first‐serve (for customers admitted to the queue) single‐server queue with exponential service times. The solution technique utilizes a semi‐Markov formulation or the decision problem.