Optimal control of tandem reentrant queues

Authors:
Ger Koole;Rhonda Righter
Affiliations:
Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands;Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA 95053, USA
Venue:
Queueing Systems: Theory and Applications
Year:
1998

Citing 2
Cited 1

Scheduling networks of queues: heavy traffic analysis of a multistation closed network

Operations Research
A tutorial on some new methods for performance evaluation of queueing networks

IEEE Journal on Selected Areas in Communications

Work-Conserving Tandem Queues

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.