Abstract
Consider n servers having different exponential service distributions. All servers are initially busy and there are m customers waiting in queue in an ordered line. A server becoming idle is offered to the first in line, if rejected it is then offered to the second, and so on. The objective of each person in line is to minimize their expected time until service completion. We give a simple approach for finding the optimal policy and also show that this policy also minimizes the expected sum of the times the customers spend in the system.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability