A STUDY ON THE SHORTEST QUEUEING MODEL WITH JOCKEYING

I. Introduction We consider many other situations; customers are often confronted with two queues, each with its own server. Customers generally enter the shortest queue available. In some situations, customers move from one queue to another. This moment is called jockeying. Such queueing systems, where customers must choose from servers, each with its own queue are called parallel queues. This concept was first studied by [5] Height (1958). His work was followed by [8] Kingman (1961) assumed that a customer would join the shortest queue available. If both queues were join the same size then a customer would join the queue. He also assumed that both servers had the same service rate. The problem to be analyzed is generally referred to as the "shortest queue problem". Zeno and Grassmann (1989) formulae based on Flatto and Mckean which were superior for numerical purposes. In this paper, we consider the following modification of the shortest queue model with jockeyin