Search

In an M/ M/1/ C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expected amount of extra revenue that the queue will earn over a finite time horizon [0, t]. There are different ways of approaching this problem. One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes; a second involves an elegant coupling argument; and a third involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix. In this paper, we shall compare and contrast these approaches and, in particular, use the coupling analysis to explain why the selling price of an extra unit of capacity remains the same when the arrival and service rates are interchanged when the queue starts at full capacity. [ABSTRACT FROM AUTHOR]