Optimal control of a removable server in an M/G/1 queue with finite capacity
From MaRDI portal
Publication:1100816
DOI10.1016/0377-2217(87)90045-2zbMath0641.60108OpenAlexW2037595959MaRDI QIDQ1100816
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90045-2
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (20)
Optimal design and control of queues ⋮ Optimal control of the \(M^ X/G/1/K\) queue with multiple server vacations ⋮ Duality relations for queues with arrival and service control ⋮ Vacation policies in an M/G/1 type queueing system with finite capacity ⋮ Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\) ⋮ Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\) ⋮ An \(M/G/1\) queue under hysteretic vacation policy with an early startup and un-reliable server ⋮ Optimal control of a removable and non-reliable server in an infinite and a finite \(M/H_2/1\) queueing system ⋮ Optimal management of the \(N\)-policy \(M/E_{k}/1\) queuing system with a removable service station: A sensitivity investigation. ⋮ Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time ⋮ A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time ⋮ A discrete-time single-server queue with a modifiedN-policy ⋮ A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning ⋮ Bi-level control for batch arrival queues with an early startup and un-reliable server ⋮ On \(M/G/1\) system under \(NT\) policies with breakdowns, startup and closedown ⋮ Optimization on bicriterion policies for M/G/1 system with second optional service ⋮ Optimal management for infinite capacityN-policy M/G/1 queue with a removable service station ⋮ A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity ⋮ A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity ⋮ Control of the service process in a queueing system
Cites Work
- Control of the service process in a queueing system
- The optimal strategy structure of an intermittently operated service channel
- DIFFUSION APPROXIMATION FOR GI/G/1 QUEUEING SYSTEMS WITH FINITE CAPACITY : II-THE STATIONARY BEHAVIOUR
- A Classified Bibliography of Research on Optimal Design and Control of Queues
- Optimal Operating Policies for M/G/1 Queuing Systems
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal control of a removable server in an M/G/1 queue with finite capacity
