Skip to main content Accessibility help
×
Home

Dynamic admission control for loss systems with batch arrivals

  • E. L. Örmeci (a1) and A. Burnetas (a2)

Abstract

We consider the problem of dynamic admission control in a Markovian loss system with two classes. Jobs arrive at the system in batches; each admitted job requires different service rates and brings different revenues depending on its class. We introduce the definition of a ‘preferred class’ for systems receiving mixed and single-class batches separately, and derive sufficient conditions for each system to have a preferred class. We also establish a monotonicity property of the optimal value functions, which reduces the number of possibly optimal actions.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Dynamic admission control for loss systems with batch arrivals
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Dynamic admission control for loss systems with batch arrivals
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Dynamic admission control for loss systems with batch arrivals
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Industrial Engineering, Koç University, Rumeli Feneri Yolu, 34450 Sarıyer, İstanbul, Turkey. Email address: lormeci@ku.edu.tr
∗∗ Postal address: Department of Mathematics, University of Athens, Panepistimiopolis, 15784 Athens, Greece. Email address: aburnetas@math.uoa.gr

References

Hide All
[1] Altman, E. (2002). Applications of Markov decision processes in communication networks. In Handbook of Markov Decision Processes, eds Feinberg, E. A. and Shwartz, A., Kluwer, Boston, MA, pp. 489536.
[2] Altman, E., Jiménez, T. and Koole, G. M. (2001). On optimal call admission control in a resource-sharing system. IEEE Trans. Commun 49, 16591668.
[3] Carrizosa, E., Conde, E. and Munoz-Marquez, M. (1998). Admission policies in loss queueing models with heterogeneous arrivals. Manag. Sci. 44, 311320.
[4] Carrol, W. and Grimes, R. (1995). Evolutionary change in product management. Experiences in the car rental industry. Interfaces 25, 84104.
[5] Geraghty, M. K. and Johnson, E. (1997). Revenue management saves national car rental. Interfaces 27, 107127.
[6] Harrison, J. M. (1975). Dynamic scheduling of a multiclass queue. Discount optimality. Operat. Res. 23, 270282.
[7] Lippman, S. A. (1975). Applying a new device in the optimization of exponential queueing systems. Operat. Res. 23, 687710.
[8] Lippman, S. A. and Ross, S. M. (1971). The streetwalker's dilemma. A Job shop model. SIAM J. Appl. Math. 20, 336342.
[9] Lippman, S. A. and Stidham, S. M. (1977). Individual versus social optimization in exponential congestion systems. Operat. Res. 25, 233247.
[10] Liu, Z., Nain, P. and Towsley, D. (1995). Sample path methods in the control of queues. Queueing Systems 21, 293336.
[11] Miller, B. (1971). A queuing reward system with several customer classes. Manag. Sci. 16, 234245.
[12] Naor, P. (1969). On the regulation of queue size by levying tolls. Econometrica 37, 1524.
[13] Örmeci, E. L. and Burnetas, A. N. (2004). Admission control with batch arrivals. Operat. Res. Lett. 32, 448454.
[14] Örmeci, E. L., Burnetas, A. N. and Emmons, H. (2002). Dynamic policies of admission to a two-class system based on customer offers. IIE Trans. 34, 813822.
[15] Örmeci, E. L., Burnetas, A. N. and van der Wal, J. (2001). Admission policies for a two class loss system. Stoch. Models 17, 513540.
[16] Puhalskii, A. A. and Reiman, M. I. (1998). A critically loaded multirate link with trunk reservation. Queueing Systems 28, 157190.
[17] Puterman, M. (1994). Markov Decision Processes. John Wiley, New York.
[18] Righter, R. (1994). Scheduling. In Stochastic Orders and Their Applications, eds Shaked, M. and Shanthikumar, J. G., Academic Press, Boston, MA, pp. 381432.
[19] Ross, K. W. (1995). Multiservice Loss Models for Broadband Telecommunication Networks. Springer, London.
[20] Ross, S. M. (1970). Applied Probability Models with Optimization Applications. Dover, New York.
[21] Savin, S., Cohen, M., Gans, N. and Katalan, Z. (2000). Capacity management in rental businesses with heterogeneous customer bases. Operat. Res. 53, 617631.
[22] Walrand, J. (1988). Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ.
[23] Xu, S. H. and Shanthikumar, J. G. (1993). Optimal expulsion control—a dual approach to admission control of an ordered-entry system. Operat. Res. 41, 11371152.

Keywords

MSC classification

Related content

Powered by UNSILO

Dynamic admission control for loss systems with batch arrivals

  • E. L. Örmeci (a1) and A. Burnetas (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.