๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Tsung-Yin Wang; Kuo-Hsiung Wang; Wen Lea Pearn


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
667 KB
Volume
228
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. Customers arrive at the system according to a Poisson process. Service times, repair times, and startup times are assumed to be generally distributed. The server is turned on after a fixed length of time T repeatedly until at least one customer is present in the waiting line. The server needs a startup time before starting the service. We analyze various system performance measures and develop the total expected cost function per unit time in which T is a decision variable. We determine the optimum threshold T * and derive analytical results for sensitivity investigations. The sensitivity analysis is particularly valuable to the system analyst when evaluating future conditions. We also present extensive numerical computation for illustration purpose.


๐Ÿ“œ SIMILAR VOLUMES


Comparison of two randomized policy M/G/
โœ Kuo-Hsiung Wang; Dong-Yuh Yang; W.L. Pearn ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

The problem addressed in this paper is to compare the minimum cost of the two randomized control policies in the M/G/1 queueing system with an unreliable server, a second optional service, and general startup times. All arrived customers demand the first required service, and only some of the arrive

Modified T vacation policy for an M/G/1
โœ Jau-Chuan Ke ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 645 KB

This paper studies the vacation policy of an M/G/1 queueing system with an unreliable server and startup. After all the customers are served in the queue exhaustively, the server deactivates and takes at most J vacations of constant time length T repeatedly until at least one customer is found waiti