A note on the optimality of the \(N\)- and \(D\)-policies for the \(M/G/1\) queue

DOI10.1016/S0167-6377(02)00148-7zbMath1013.90040OpenAlexW2045831032MaRDI QIDQ1870014

Jesus R. Artalejo

Publication date: 4 May 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00148-7

zbMATH Keywords

\(M/G/1\) queuecontrol of the service process

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (11)

Optimal design and control of queues ⋮ Queue Length Analysis of MAP/G/1 Queue UnderD-Policy ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Analysis of theM^X/G/1 Queue UnderD-Policy ⋮ Optimal control policy of M/G/1 queueing system with delayed randomized multiple vacations under the modified min \((N, D)\)-policy control ⋮ Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy ⋮ Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness ⋮ Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline ⋮ An optimal \(P_{\lambda}^{M}\)-service policy for an \(M/G/1\) queueing system ⋮ BMAP/G/1 Queue UnderD-Policy: Queue Length Analysis ⋮ MAP/G/1 Queue Under Workload Control and Postprocessing

Cites Work

• On the M/G/1 queue with \(D\)-policy
• On optimal exhaustive policies for the M/G/1-queue
• The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy
• Note—Note on a Control Problem of Balachandran and Tijms
• Unnamed Item

This page was built for publication: A note on the optimality of the \(N\)- and \(D\)-policies for the \(M/G/1\) queue