Structural results on a batch acceptance problem for capacitated queues

The purpose of this paper is to investigate the structural properties of the optimal batch acceptance policy in a Markovian queueing system where different classes of customers arrive in batches and the buffer capacity is finite. We prove that the optimal policy can possess certain monotonicity properties under the assumptions of a single-server and constant batch sizes. Even though our proof cannot be extended to cases where either one of the assumptions is relaxed, we numerically observe that the optimal policy can still possess the same properties when only the single-server assumption is relaxed. Finally, we present counterexamples that show the non-monotone structure of the optimal policy when the batch sizes are not constant.

[1]  Shaler Stidham,et al.  Analysis, Design, and Control of Queueing Systems , 2002, Oper. Res..

[2]  Apostolos Burnetas,et al.  Dynamic admission control for loss systems with batch arrivals , 2005, Advances in Applied Probability.

[3]  Eitan Altman,et al.  On optimal call admission control in resource-sharing system , 2001, IEEE Trans. Commun..

[4]  Ger Koole,et al.  Structural results for the control of queueing systems using event-based dynamic programming , 1998, Queueing Syst. Theory Appl..

[5]  Sheldon M. Ross,et al.  The Streetwalker’s Dilemma: A Job Shop Model , 1971 .

[6]  V. Kulkarni,et al.  Optimal admission control of markov-modulated batch arrivals to a finite-capacity buffer , 1998 .

[7]  K. Waldmann,et al.  Optimal control of arrivals to multiserver queues in a random environment , 1984 .

[8]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

[9]  E. Lerzan Örmeci,et al.  Admission Policies for a Two Class Loss System with General Interarrival Times , 1999 .

[10]  Euclid,et al.  Advances in Applied Probability , 1981, Journal of Applied Probability.

[11]  Morris A. Cohen,et al.  Capacity Management in Rental Businesses with Two Customer Bases , 2005, Oper. Res..

[12]  Hans-Joachim Langen.  Applying the method of phases in the optimization of queuing systems , 1982, Advances in Applied Probability.

[13]  Apostolos Burnetas,et al.  Admission control with batch arrivals , 2004, Oper. Res. Lett..

[14]  E. Altman,et al.  On optimal call admission control , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[15]  Mark P. Van Oyen,et al.  Beyond the cμ rule: Dynamic scheduling of a two-class loss queue , 1998, Math. Methods Oper. Res..

[16]  A. Shwartz,et al.  Handbook of Markov decision processes : methods and applications , 2002 .

[17]  Steven A. Lippman,et al.  Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..

[18]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[19]  Shaler Stidham,et al.  Control of arrivals to two queues in series , 1985 .

[20]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[21]  Shaler Stidham,et al.  Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue , 1978 .

[22]  D. Towsley,et al.  Optimal control of admission to a multi-server queue with two arrival streams , 1992 .

[23]  Apostolos Burnetas,et al.  Admission policies for a two class loss system , 2001 .

[24]  Noah Gans,et al.  Pricing and Capacity Rationing in Rentals , 2001 .

[25]  Eitan Altman,et al.  Applications of Markov Decision Processes in Communication Networks , 2000 .