The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider a queueing systems with two parallel servers. Each server has a queue with infinite capacity. Customers arrive according to a Possion process and join the shortest queue. The service times of customers are independent and have generally distributed. If both queues have equal length, the new arrival with equal probability joins any of a queue. Jockeying between the queues...
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,...
In this paper, we analyze the single-server G/G/1 queue. Let η denote the elapsed interarrival time at time 0. Assume that η ≥ 0, we obtain the transient distribution of queue length by using the Markov skeleton processes theory.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.