Abstract
A queuing system has restricted accessibility if not every customer is admitted to the system. In this paper a single server queuing system is studied, where the arriving customers are rejected if their waiting plus service times would exceed a fixed amount K. The arrivals follow a Poisson process. In this case an equation for the stationary waiting time distribution is given. The explicit solution of this equation is obtained, when the service time is assumed to be constant. For this model the queue length distribution is also easily derived. It is observed that the queue with finite waiting room is a special case of this model.
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.
