On the optimal allocation of customers that must depart in sequence

DOI10.1016/0167-6377(94)90012-4zbMath0806.90044OpenAlexW2088064931MaRDI QIDQ1331883

Anurag Kumar, Joy Kuri

Publication date: 29 August 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90012-4

zbMATH Keywords

optimal schedulingqueues with resequencinground-robin allocation policy

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (2)

Task allocation in multiserver systems -- a survey of results. ⋮ Multiple-server system with flexible arrivals

Cites Work

• An upper bound for multi-channel queues

This page was built for publication: On the optimal allocation of customers that must depart in sequence