Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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.
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Sankar Basu
Journal of the Franklin Institute
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences