Abstract
We consider an M [ x ] /G/1 queueing system with a startup time, where all arriving customers demand first the essential service and some of them may further demand one of other optional services: Type 1, Type 2, … , and Type J service. The service times of the essential service and of the Type i ( i = 1 , 2 , … , J ) service are assumed to be random variables with arbitrary distributions. The server is turned off each time when the system is empty. As soon as a customer or a batch of customers arrives, the server immediately performs a startup which is needed before starting each busy period. We derive the steady-state results, including system size distribution at a random epoch and at a departure epoch, the distributions of idle and busy periods, and waiting time distribution in the queue. Some special cases are also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
