IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v41y1993i6p1137-1152.html
   My bibliography  Save this article

Optimal Expulsion Control—A Dual Approach to Admission Control of an Ordered-Entry System

Author

Listed:
  • Susan H. Xu

    (Pennsylvania State University, University Park, Pennsylvania)

  • J. George Shanthikumar

    (University of California, Berkeley, California)

Abstract

In this paper we obtain the optimal admission control policy for a first-come, first-served (FCFS) M / M / m ordered-entry queueing system to maximize the expected discounted (and the long-run average) profit (reward minus cost). We introduce a new approach for determining the optimal admission control policy. The underlying idea of this approach is to construct a dual system: a preemptive last-come, first-served (LCFS-P) M / M / m ordered-entry queueing system that is subject to expulsion control . We show that an LCFS-P system with expulsion control is isomorphic to an FCFS system with admission control, and the two systems share the same optimal control policy. Eluding the conventional dynamic programming formulation, we approach the solution from behaviors of individual customers and their impact on the social outcome. This makes our analysis simple and intuitive and reveals a better insight into the structural properties of the optimal control policy. Besides providing formulas to compute the optimal threshold, we use the operational characteristics of the dual system to obtain an easily computable approximation for the optimal threshold. The applicability of the approach transcends well beyond the problem addressed in this paper.

Suggested Citation

  • Susan H. Xu & J. George Shanthikumar, 1993. "Optimal Expulsion Control—A Dual Approach to Admission Control of an Ordered-Entry System," Operations Research, INFORMS, vol. 41(6), pages 1137-1152, December.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:6:p:1137-1152
    DOI: 10.1287/opre.41.6.1137
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.6.1137
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.6.1137?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
    ---><---

    Citations

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


    Cited by:

    1. Eitan Altman & Nahum Shimkin, 1998. "Individual Equilibrium and Learning in Processor Sharing Systems," Operations Research, INFORMS, vol. 46(6), pages 776-784, December.
    2. Refael Hassin & Yair Y. Shaki & Uri Yovel, 2015. "Optimal service‐capacity allocation in a loss system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 81-97, March.
    3. Vernon N. Hsu & Susan H. Xu & Boris Jukic, 2009. "Optimal Scheduling and Incentive Compatible Pricing for a Service System with Quality of Service Guarantees," Manufacturing & Service Operations Management, INFORMS, vol. 11(3), pages 375-396, May.
    4. Bertrand, J. Will M. & van Ooijen, Henny P.G., 2012. "The capacity investment decision for make-to-order production systems with demand rate control," International Journal of Production Economics, Elsevier, vol. 137(2), pages 272-283.
    5. Refael Hassin & Ran I. Snitkovsky, 2020. "Social and Monopoly Optimization in Observable Queues," Operations Research, INFORMS, vol. 68(4), pages 1178-1198, July.
    6. Suresh K. Nair & Ravi Bapna, 2001. "An application of yield management for Internet Service Providers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 348-362, August.

    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:inm:oropre:v:41:y:1993:i:6:p:1137-1152. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.