Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times

DOI10.1016/J.CAM.2008.09.021zbMath1164.60075OpenAlexW2000324908MaRDI QIDQ1019796

Tsung-Yin Wang, Wen Lea Pearn, Kuo-Hsiung Wang

Publication date: 28 May 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.09.021

zbMATH Keywords

optimizationM/G/1 queuegeneral repair timegeneral startup time

Mathematics Subject Classification ID

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

Related Items (7)

Threshold properties of the \(M/M/1\) queue under T-policy with applications ⋮ The impact of the \(NT\)-policy on the behaviour of a discrete-time queue with general service times ⋮ Cost evaluation in M/G/1 queue with T-policy revisited, technical note ⋮ Analysis of a batch service multi-server polling system with dynamic service control ⋮ Comparison of two randomized policy \(M/G/1\) queues with second optional service, server breakdown and startup ⋮ A study on the behaviour of the server breakdown without interruption in a \(M^{x}/G(a,b)/1\) queueing system with multiple vacations and closedown time ⋮ Randomized controlling arrival for a queueing system with subject to server breakdowns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(M/G/1/K\) queues with \(N\)-policy and setup times
• Modified \(T\) vacation policy for an \(M/G/1\) queueing system with an unreliable server and startup
• A Poisson input queue under \(N\)-policy and with a general start up time
• An analysis of the \(M/G/1\) system with \(N\) and \(T\) policy
• Control Policies of an M/G/1 Queueing System with a Removable and Non-reliable Server
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Utilization of Idle Time in an M/G/1 Queueing System
• The T-Policy for the M/G/1 Queue
• Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
• On an M/G/1 quorum queueing system under T-policy
• Optimal (N,T)-policy for M/G/1 system with cost structures

This page was built for publication: Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times