Comparison of two randomized policy \(M/G/1\) queues with second optional service, server breakdown and startup
type: Item
instance of: scholarly article
title: Comparison of two randomized policy \(M/G/1\) queues with second optional service, server breakdown and startup
zbMATH Open document ID: 1201.60090
author: Kuo-Hsiung Wang
author: Dong-Yuh Yang
author: Wen Lea Pearn
published in: Journal of Computational and Applied Mathematics
publication date: 2010-04-27T00:00:00Z
review text: The aim of this paper is to compare two optimal policies: \((T,p)\)-policy and \((p,N)\)-policy for \(M/G/1\) queues with an unreliable server, a second optional service, and general startup times. All customers that arrive in the system demand a first (required) service, and only some of customers require a second (optional) service. The server needs a startup time before providing the first required service. As soon as the system becomes empty after servicing all customers, the server takes a vacation, and the system operates according to one of the policies \((T,p)\) or \((p,N)\). The \((T,p)\)-policy is an extension of \(T\)-policy (the case \(p=1\)), which has been introduced by \textit{D. P. Heyman} [Manag. Sci. 23, 775--778 (1977; Zbl 0357.60022)]. The \((T,p)\)-policy is characterized as follows. If the server is empty, then the server is switched off and the vacation time \(T\) is required, which is repeated if there is no arrival during this time \(T\). If there is at least one arrival, then the server is switched on with probability \(p\), or with complementary probability \(1-p\) remains to be switched off. The \((p,N)\)-policy is defined as follows. As the system becomes empty, the server is turned off. If upon arrival of a customer in the system, the total number of customers reaches \(N\), then the server is turned on with probability \(p\), and with the complementary probability \(1-p\) remains to be switched off. The papers finds closed form for joint optimal solutions (defined explicitly in the paper) for these two policies. It is shown that under optimal operating conditions, the \((p,N)\)-policy has a lower cost than that of the \((T,p)\)-policy.
reviewed by: Vyacheslav Abramov
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5702042
zbMATH Keywords: comparison
zbMATH Keywords: optimization
zbMATH Keywords: second optional service
zbMATH Keywords: \((p,N)\)-policy
zbMATH Keywords: \((T,p)\)-policy
MaRDI profile type: Publication
full work available at URL: j.cam.2010.01.045
OpenAlex ID: W2059270233
cites work: The T-Policy for the M/G/1 Queue
cites work: Optimal Control of an M/E k /1 Queueing System with Removable Service Station Subject to Breakdowns
cites work: Control Policies of an M/G/1 Queueing System with a Removable and Non-reliable Server
cites work: Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations
cites work: \(M/G/1/K\) queues with \(N\)-policy and setup times
cites work: Optimal strategy in N-policy production system with early set-up
cites work: The effect of different arrival rates on the \(N\)-policy of M/G/1 with server setup
cites work: Bi-level control for batch arrival queues with an early startup and un-reliable server
cites work: Optimal control of the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
cites work: Modified \(T\) vacation policy for an \(M/G/1\) queueing system with an unreliable server and startup
cites work: An M\(^{[x]}\)/G/1 system with startup server and \(J\) additional options for service
cites work: Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times
cites work: An M/G/1 queue with second optional service
cites work: A single server Poisson input queue with a second optional channel
cites work: Q4461879
cites work: An M/G/1 queue with second optional service and server breakdowns
cites work: A discrete-time \(Geo/G/1\) retrial queue with starting failures and second optional service
cites work: A repairable queueing model with two-phase service, start-up times and retrial customers
cites work: Analysis of a retrial queue with two-phase service and server vacations
cites work: A batch arrival retrial queueing system with two phases of service and service interruption
cites work: Bicriterion Optimization of an M/G/1 Queue with A Removable Server
cites work: A maximum entropy approach for the \(\langle p,N\rangle\)-policy \(M/G/1\) queue with a removable and unreliable server
cites work: Steady-state probability of the randomized server control system with second optional service, server breakdowns and startup
cites work: Notes of \(M/G/1\) system under the \(\langle p,T\rangle\) policy with second optional service
cites work: Optimization on bicriterion policies for M/G/1 system with second optional service
DOI: 10.1016/J.CAM.2010.01.045
description: scientific article; zbMATH DE number 5702042