A.R. Conn, Nick Gould, et al.
Mathematics of Computation
We study a system of two queues in tandem with finite buffers, Poisson arrivals to the first station, and exponentially distributed service times at both stations. Losses are incurred either when a customer is rejected at the time of arrival to the first station or when the second station is full at the time of service completion at the first station. The objective is to determine the optimal admission control policy that minimizes the long-run average cost. © 2013 Elsevier B.V. All rights reserved.
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000