Abstract
A single server attends to two separate queues. Each queue has Poisson arrivals and a general service time distribution. A changeover time, with a general distribution, is required whenever the server crosses from one queue to the other. This paper investigates two queue disciplines: alternating priority and strict priority. In each case, it obtains the Laplace-Stieltjes transforms of the waiting-time distributions for a stationary process, as well as the first moments of the waiting-time distributions.
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.
