We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisition of new customers. The server has to divide its energy between both activities. The number of newly acquired customers is uncertain, and the effect of the server's acquisition efforts can only be seen after some fixed time period ? (delay). #R##N##R##N#The acquisition queue constitutes a (?+1)-dimensional Markov chain. The limiting queue length distribution is derived in terms of its probability generating function, and an exact expression for the mean queue length is given. For large values of ? the numerical procedures needed for calculating the mean queue length become computationally cumbersome. We therefore complement the exact expression with a fluid approximation. #R##N##R##N#One of the key features of the acquisition queue is that the server performs more acquisition when the queue is small. Together with the delay, this causes the queue length process to show a strongly cyclic behavior. We propose and investigate several ways of planning the acquisition efforts. In particular, we propose an acquisition scheme that is designed specifically to reduce the cyclic behavior of the queue length process.
['Dee Denteneer', 'J. S. Leeuwaarden', 'Ivo J. B. F. Adan']
The acquisition queue