Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
From MaRDI portal
Publication:964838
DOI10.1007/s10626-007-0024-1zbMath1184.90049OpenAlexW2089046940MaRDI QIDQ964838
Ho Woo Lee, Se Won Lee, Jung Woo Baek, Sahng Hoon Cheon
Publication date: 21 April 2010
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10356/96937
Queues and service in operations research (90B22) Design techniques (robust design, computer-aided design, etc.) (93B51)
Related Items
Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy ⋮ MAP/G/1 Queue Under Workload Control and Postprocessing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal design and control of queues
- Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations
- On the M/G/1 queue with \(D\)-policy
- On optimal exhaustive policies for the M/G/1-queue
- Workload and waiting time analyses of MAP/G/1 queue under \(D\)-policy
- A note on the optimality of the \(N\)- and \(D\)-policies for the \(M/G/1\) queue
- Optimality of \(D\)-policies for an \(M\)/\(G\)/1 queue with a removable server
- Queue Length Analysis of MAP/G/1 Queue UnderD-Policy
- New results on the single server queue with a batch markovian arrival process
- The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy
- Generalizations of the stochastic decomposition results for single server queues with vacations
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A Unified Framework for the Analysis of M/G/1 Queue Controlled by Workload
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- On Stochastic Decomposition in M/G/1 Type Queues with Generalized Server Vacations
- The N/G/1 queue and its detailed analysis
- Utilization of Idle Time in an M/G/1 Queueing System
- Comment on “Solving the ‘Marketing Mix’ Problem using Geometric Programming”
- Note—Note on a Control Problem of Balachandran and Tijms
- On a Switch-Over Policy for Controlling the Workload in a Queueing System with Two Constant Service Rates and Fixed Switch-Over Costs
- The T-Policy for the M/G/1 Queue
- A Classified Bibliography of Research on Optimal Design and Control of Queues
- Queueing processes in bulk systems under the D-policy
- Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
- On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals
- Control Policies for a Single Server System
- Letters to the Editor
This page was built for publication: Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
