IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v49y2017i6p603-621.html
   My bibliography  Save this article

The value of service rate flexibility in an queue with admission control

Author

Listed:
  • Yiannis Dimitrakopoulos
  • Apostolos Burnetas

Abstract

We consider a single-server queueing system with admission control and the possibility to switch dynamically between k increasing service rate values with the service cost rate being convex in the service rate. We explore the benefit due to service rate flexibility on the optimal profit and the admission thresholds, when service payment is made upon customer's admission. We formulate a Markov Decision Process model for the problem of joint admission and service control considering both discounted and average expected profit maximization and show that the optimal policy has a threshold structure for both controls. Regarding the benefit due to flexibility, we show that it is increasing in system length and that its effect on the admission policy is to increase the admission threshold. We also derive a simple approximate condition between the admission reward and the relative cost of service rate increase, so that the service rate flexibility is beneficial. We finally show that the results extend to the corresponding model where service payment is made at the end of each service completion and differences regarding the benefit due to service flexibility with respect to the original model are pursued numerically.

Suggested Citation

  • Yiannis Dimitrakopoulos & Apostolos Burnetas, 2017. "The value of service rate flexibility in an queue with admission control," IISE Transactions, Taylor & Francis Journals, vol. 49(6), pages 603-621, June.
  • Handle: RePEc:taf:uiiexx:v:49:y:2017:i:6:p:603-621
    DOI: 10.1080/24725854.2016.1269976
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2016.1269976
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2016.1269976?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Galit B. Yom-Tov & Carri W. Chan, 2021. "Balancing admission control, speedup, and waiting in service systems," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 163-219, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:49:y:2017:i:6:p:603-621. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.