A problem of queueing in lanes treated by Hauer and Templeton is generalized and a solution provided through the use of some combinatorial lemmas. The taxonomy of the Hauer-Templeton model is clarified. Further areas of possible application of the ideas involved are suggested.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.