Abstract

This paper deals with the GI/G/1 queuing system with a random setup time. The server is turned off each time when the system becomes empty. At this point of time the idle period starts. As soon as a customer arrives, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the transient distribution of queue length by applying the Markov skeleton process approach. We show that the transient distribution of queue length is the minimal nonnegative solution and also the unique bounded solution to a nonnegative linear equation.

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 call

Disclaimer: 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.