Abstract
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the last-buffer first-served (LBFS) policy stochastically maximizes the departure process.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have