IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v67y2008i2p285-297.html
   My bibliography  Save this article

Admission control of a service station when the arrivals are internal

Author

Listed:
  • Yarlin Kuo

Abstract

All studies in the admission control of a service station make decisions at arrival epochs. When arrivals are internal and are rejected from a queue, the rejected jobs have to be routed to other stations in the system. However the system will not know whether a job will be admitted to a queue or not until its arrival epoch to that queue. Thus, the system has to react dynamically and agilely to the decisions made at a specific queue and may try several queues before finding a queue that admits the job. This paper remedies these difficulties by changing the decision epochs of the admission control from arrival epochs to departure epochs with the actions of switching (keeping) the arrival stream on or off. Thus upstream stations will have information on the admission status of their downstream stations all the time. It is proved that the optimal policy for this revised admission control system is of control limit type for an M/G/1 queue. Comparisons of the optimal values and optimal policies for the admission controls made at arrival epochs and at departure epochs are included in the paper. Copyright Springer-Verlag 2008

Suggested Citation

  • Yarlin Kuo, 2008. "Admission control of a service station when the arrivals are internal," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 285-297, April.
    • Handle: RePEc:spr:mathme:v:67:y:2008:i:2:p:285-297
    DOI: 10.1007/s00186-007-0153-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-007-0153-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-007-0153-1?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.

    References listed on IDEAS

    as
    1. Steven A. Lippman & Shaler Stidham, 1977. "Individual versus Social Optimization in Exponential Congestion Systems," Operations Research, INFORMS, vol. 25(2), pages 233-247, April.
    2. Uri Yechiali, 1971. "On Optimal Balking Rules and Toll Charges in the GI / M /1 Queuing Process," Operations Research, INFORMS, vol. 19(2), pages 349-370, April.
    3. Uri Yechiali, 1972. "Customers' Optimal Joining Rules for the GI/M/s Queue," Management Science, INFORMS, vol. 18(7), pages 434-443, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    2. Refael Hassin & Ran I. Snitkovsky, 2020. "Social and Monopoly Optimization in Observable Queues," Operations Research, INFORMS, vol. 68(4), pages 1178-1198, July.
    3. Shone, Rob & Knight, Vincent A. & Williams, Janet E., 2013. "Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior," European Journal of Operational Research, Elsevier, vol. 227(1), pages 133-141.
    4. Shu Zhang & Jeffrey W. Ohlmann & Barrett W. Thomas, 2018. "Dynamic Orienteering on a Network of Queues," Transportation Science, INFORMS, vol. 52(3), pages 691-706, June.
    5. Zhang, Shu & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2014. "A priori orienteering with time windows and stochastic wait times at customers," European Journal of Operational Research, Elsevier, vol. 239(1), pages 70-79.
    6. Radhakrishnan, Suresh & Balachandran, Kashi R., 1995. "Stochastic choice hazard and incentives in a common service facility," European Journal of Operational Research, Elsevier, vol. 81(2), pages 324-335, March.
    7. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2020. "A service system with perishable products where customers are either fastidious or strategic," International Journal of Production Economics, Elsevier, vol. 228(C).
    8. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    9. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
    10. van Ackere, Ann, 1996. "The management of congestion," European Journal of Operational Research, Elsevier, vol. 89(2), pages 223-225, March.
    11. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    12. Zhang, Zhe George & Yin, Xiaoling, 2021. "Information and pricing effects in two-tier public service systems," International Journal of Production Economics, Elsevier, vol. 231(C).
    13. Lan Lu & Zheng Zhu & Pengfei Guo & Qiao‐Chu He, 2022. "Service Operations for Mixed Autonomous Paradigm: Lane Design and Subsidy," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1595-1612, April.
    14. Albert Y. Ha, 1998. "Incentive-Compatible Pricing for a Service Facility with Joint Production and Congestion Externalities," Management Science, INFORMS, vol. 44(12-Part-1), pages 1623-1636, December.
    15. Prabhudev Konana & Alok Gupta & Andrew B. Whinston, 2000. "Integrating User Preferences and Real-Time Workload in Information Services," Information Systems Research, INFORMS, vol. 11(2), pages 177-196, June.
    16. Shiliang Cui & Xuanming Su & Senthil Veeraraghavan, 2019. "A Model of Rational Retrials in Queues," Operations Research, INFORMS, vol. 67(6), pages 1699-1718, November.
    17. Li, Xin & Chen, Hsing Hung & Tao, Xiangnan, 2016. "Pricing and capacity allocation in renewable energy," Applied Energy, Elsevier, vol. 179(C), pages 1097-1105.
    18. Aktaran-KalaycI, Tûba & Ayhan, Hayriye, 2009. "Sensitivity of optimal prices to system parameters in a steady-state service facility," European Journal of Operational Research, Elsevier, vol. 193(1), pages 120-128, February.
    19. Eitan Altman & Nahum Shimkin, 1998. "Individual Equilibrium and Learning in Processor Sharing Systems," Operations Research, INFORMS, vol. 46(6), pages 776-784, December.
    20. Canbolat, Pelin G., 2020. "Bounded rationality in clearing service systems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 614-626.

    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:spr:mathme:v:67:y:2008:i:2:p:285-297. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.