Abstract

In this paper, we consider a service systems consisting of two parallel servers. Each server has a queue with infinite capacity. The arrival process of customers is a renewal process and the service times of customers are independent and exponentially distributed with different parameter in different queue. A new arrival join the shortest of two queues, where in case of both queues have equal length, the arrival join any of the two queues according to some arbitrary probability distribution. Jockeying between the queues is not allowed. By Markov skeleton processes theory, we obtain the transient queue length distribution, and show that it is the minimal nonnegative solution of a backward 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.