Optimal control of tandem reentrant queues

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 lastbuffer-first-served (LBFS) policy stochastically maximizes the departure process. 0 

• Type: Journal
• Year: 1998
• Where: QUESTA
• Authors: Ger Koole, Rhonda Righter
• Keywords: Optimal Policies, QUESTA 1998, Reentrant Queues, Tandem Reentrant