Abstract
We consider an M/G/1 queue in which an arriving customer does not enter the system whenever its virtual waiting time, i.e. the amount of work seen upon arrival, is larger than a certain random patience time. We determine the busy period distribution for various choices of the patience time distribution. The main cases under consideration are exponential patience and a discrete patience distribution.
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.
