Consider anM/G/1production 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.
In this paper we determine and compare the optimal capacity (K) of a GI/G/1/K queuing system under social and individual optimization. It is shown by simulation that irrespective of the traffic intensity, p, and arrival and service time distributions, the K obtained from social optimization of the system is always equal to or less than the K obtained from its individual optimization.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.