Optimal admission policies for a finite queue with bursty arrivals

DOI10.1007/BF02055584zbMath0717.90028MaRDI QIDQ2638916

Lamond, Bernard F.

Publication date: 1991

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

infinite horizonsingle serverservice systemfinite waiting roomdiscrete time Markov decision processdeterministic service timebursty arrivalsmonotone admission policytotal discounted revenuetwo classes of customers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A general storage model with applications to energy systems ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Lower bounding aggregation and direct computation for an infinite horizon one-reservoir model

Cites Work

• Unnamed Item
• Unnamed Item
• Note—A Note on Computing Optimal Control Limits for GI/M/1 Queueing Systems
• Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals
• Optimal control of admission to a quenching system
• Control of arrivals to a stochastic input–output system
• Applying the method of phases in the optimization of queuing systems
• Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue
• Applying a New Device in the Optimization of Exponential Queuing Systems
• A Queuing-Type Birth-and-Death Process Defined on a Continuous-Time Markov Chain
• Queuing Problems with Heterogeneous Arrivals and Service

This page was built for publication: Optimal admission policies for a finite queue with bursty arrivals