This paper deals with the steady state behaviour of an M⁄M⁄c queueing system with a general startup time under N-policy, where the system is turned off as soon as the system becomes empty and turned on again when the queue size becomes ‘ N’. The service of the first customer in each busy period is always preceded by a random startup time (during which no proper work is done) to gearup the system. We place our emphasis on understanding the operational characteristic of the queueing system and derive the probability generating functions of the queue size distribution and joint distribution of the number of arrivals and startup time. Also, we provide appropriate interpretation of the queue size distribution and other performance measures. Finally, we verify some results of M⁄M⁄1 queueing system with general startup time under N-policy.
Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.
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.