Controlling the workload of M/G/1 queues via the \(q\)-policy

DOI10.1016/j.ejor.2014.12.036zbMath1346.90250OpenAlexW2157230362MaRDI QIDQ319160

Val Andrei Fajardo, Steve Drekic

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.036

zbMATH Keywords

queueingcustomer blockinglevel crossing analysisM/G/1 queue with accumulating priority

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

Finite-time ruin probabilities using bivariate Laguerre series ⋮ Waiting time distributions in the preemptive accumulating priority queue ⋮ On a general mixed priority queue with server discretion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Waiting time distributions in the accumulating priority queue
• Continuous time control of the arrival process in an M/G/1 queue
• Some properties of optimal control policies for entry to an M/M/1 queue
• Single-Server with Delay-Dependent Arrival Streams
• Analysis, Design, and Control of Queueing Systems
• Optimal control of admission to a quenching system
• Control of arrivals to a stochastic input–output system
• The Regulation of Queue Size by Levying Tolls
• On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
• Individual and Social Optimization in a Multiserver Queue with a General Cost-Benefit Structure
• Level crossing methods in stochastic models

This page was built for publication: Controlling the workload of M/G/1 queues via the \(q\)-policy