It is usual in the theory of queues to assume that customers are served in the order of their arrival. In some applications (e.g. telephone engineering), however, other forms of queue discipline are more realistic. The precise effect of any such change on the waiting-time distribution of a customer will depend on the procedure envisaged (random service, “last come, first served”, etc.), but it is possible to make certain general statements. Thus it is well known that, under certain conditions, the mean is independent of the queue discipline. The purpose of the present note is to consider the variance of waiting time, and we shall prove that this is a minimum when the customers are served in order of arrival. Thus this is, in a sense, the “fairest” queue discipline. This does not, of course, mean that other procedures may not be justified when different criteria are taken into account.