In this paper a M X /G (a, b)/1 queueing system with multiple vacations, setup time with N-policy and closedown times is considered. On completion of a service, if the queue length is n, where n < a, then the server performs closedown work. Following closedown the server leaves for multiple vacations of random length irrespective of queue length. When the server returns from a vacation and if the queue length is still less than ÔNÕ, he leaves for another vacation and so on, until he finds ÔNÕ (N > b) customers in the queue. That is, if the server finds at least ÔNÕ customers waiting for service, then he requires a setup time ÔRÕ to start the service. After the setup he serves a batch of ÔbÕ customers, where b P a. Various characteristics of the queueing system and a cost model with the numerical solution for a particular case of the model are presented.
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.