The evaluation of computer performance by means of state-dependent queueing network models

Imperial Users onl

Reservicing Some Customers In M/G/1 Queues Under Three Disciplines

Consider an M/G/1 production line in which a production item is failed with some probability and is then repaired. We consider three repair disciplines depending on whether the failed item is repaired immediately or first stockpiled and repaired after all customers in the main queue are served or the stockpile reaches a specified threshold. For each discipline, we find the probability generating function (p.g.f.) of the steady-state size of the system at the moment of departure of the customer in the main queue, the mean busy period, and the probability of the idle period

© Hindawi Publishing Corp. RESERVICING SOME CUSTOMERS IN M/G/1 QUEUES UNDER THREE DISCIPLINES

Consider an M/G/1 production line in which a production item is failed with some probability and is then repaired. We consider three repair disciplines depending on whether the failed item is repaired immediately or first stockpiled and repaired after all customers in the main queue are served or the stockpile reaches a specified threshold. For each discipline, we find the probability generating function (p.g.f.) of the steady-state size of the system at the moment of departure of the customer in the main queue, the mean busy period, and the probability of the idle period. 2000 Mathematics Subject Classification: 60K25, 68M20, 90B22. 1. Introduction. Conside