Two Unordered Queues

A special customer must complete service from two servers in series, in either order, each with an M/M/1 queueing system. It is assumed that the two queueing system lengths are independent with initial numbers of customers a and b at the instant when the special customer arrives. We find the expected total time (ETT) for the special customer to complete service. We show that even if the interarrival and service time parameters of two queues are identical, there exist examples (specific values of the parameters and initial lengths) for which the special customer surprisingly has a lower expected total time to completion by joining the longer queue first rather than the shorter one.Comment: Presented at AMMCS 2011 Conference, July 25, 201

Service and price competition when customers are naive

We consider a system of two service providers each with a separate queue. Customers choose one queue to join upon arrival and can switch between queues in real time before entering service to maximize their spot utility, which is a function of price and queue length. We characterize the steady-state distribution for queue lengths, and then investigate a two-stage game in which the two service providers first simultaneously select service rates and then simultaneously charge prices. Our results indicate that neither service provider will have both a faster service and a lower price than its competitor. When price plays a less significant role in customers service selection relative to queue length or when the two service providers incur comparable costs for building capacities, they will not engage in price competition. When price plays a significant role and the capacity costs at the service providers sufficiently differ, they will adopt substitutable competition instruments: the lower cost service provider will build a faster service and the higher cost service provider will charge a lower price. Comparing our results to those in the existing literature, we find that the service providers invest in lower service rates, engage in less intense price competition, and earn higher profits, while customers wait in line longer when they are unable to infer service rates and are naive in service selection than when they can infer service rates to make sophisticated choices. The customers jockeying behavior further lowers the service providers capacity investment and lengthens the customers duration of stay

Bad Luck When Joining the Shortest Queue

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.Queueing;Join-the-shortest-queue;Probability of bad luck;Power-series algorithm;Overtaking customers;Dedicated customers

Bounds for performance characteristics : a systematic approach via cost structures

In this paper we present a systematic approach to the construction of bounds for the average costs in Markov chains with possibly infinitely many states. The technique used to prove the bounds is based on dynamic programming. Most performance characteristics of Markovian systems can be represented by the average costs for some appropriately chosen cost structure. Therefore, the approach can be used to generate bounds for relevant performance characteristics. The approach is demonstrated for the shortest queue model. It is shown how for this model several bounds for the mean waiting time can be constructed. We include numerical results to demonstrate the quality of these bound

Shortest Expected Delay Routing for Erlang Servers

The queueing problem with a Poisson arrival stream and two identical Erlang servers is analysed for the queueing discipline based on shortest expected delay. This queueing problem may be represented as a random walk on the integer grid in the first quadrant of the plane. In the paper it is shown that the equilibrium distribution of this random walk can be written as a countable linear combination of product forms. This linear combination is constructed in a compensation procedure. In this case the compensation procedure is essentially more complicated than in other cases where the same idea was exploited. The reason for the complications is that in this case the boundary consists of several layers which in turn is caused by the fact that transitions starting in inner states are not restricted to end in neighbouring states. Good starting solutions for the compensation procedure are found by solving the shortest expected delay problem with the same service distributions but with instantaneous jockeying. It is also shown that the results can be used for an efficient computation of relevant performance criteria

A compensation approach for queueing problems

No abstract