A \(P_{\lambda}^M\)-policy for an \(M/G/1\) queueing system
From MaRDI portal
Publication:1861696
DOI10.1016/S0307-904X(02)00045-8zbMath1175.90104MaRDI QIDQ1861696
Jongho Bae, Sunggon Kim, Eui Yong Lee
Publication date: 10 March 2003
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (11)
Stationary distribution of queue length in \(G/M/1\) queue with two-stage service policy ⋮ The virtual waiting time of the M/G/1 queue with customers of \(n\) types of impatience ⋮ Stationary distribution of the surplus in a risk model with dividends and reinvestments ⋮ Workload analysis of an \(M/G/1\) queue under the \(P^{M}_{\lambda}\) policy with a set-up time ⋮ Control of dams using \(P^M_{\lambda,\tau}\) policies when the input process is a nonnegative Lévy process ⋮ A \(G/M/1\) queueing system with \(P_\lambda^M\)-service policy ⋮ A workload-dependent \(M/G/1\) queue under a two-stage service policy ⋮ The stationary workload of the \(G/M/1\) queue with impatient customers ⋮ An optimal \(P_{\lambda}^{M}\)-service policy for an \(M/G/1\) queueing system ⋮ Optimal Control of a Large Dam ⋮ Average cost under the PMλ, τ policy in a finite dam with compound Poisson inputs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Two-stage output procedure of a finite dam
- On up- and downcrossings
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- Properties of the Process of Level Crossings During a Busy Cycle of the M/G/1 Queueing System
- PλM-policy for a dam with input formed by a compound Poisson process
- Optimal control of finite dams: discrete (2-stage) output procedure
- The distribution of the content of finite dams
- The virtual waiting time of the M/G/1 queue with impatient customers
This page was built for publication: A \(P_{\lambda}^M\)-policy for an \(M/G/1\) queueing system