IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v18y2010i3p241-268.html
   My bibliography  Save this article

Equilibrium threshold strategies in observable queueing systems with setup/closedown times

Author

Listed:
  • Wei Sun
  • Pengfei Guo
  • Naishuo Tian

Abstract

This paper considers two types of setup/closedown policies: interruptible and insusceptible setup/closedown policies. When all customers are served exhaustively in a system under the interruptible setup/closedown policy, the server shuts down (deactivates) by a closedown time. When the server reactivates since shutdown, he needs a setup time before providing service again. If a customer arrives during a closedown time, the service is immediately started without a setup time. However, in a system under the insusceptible setup/closedown policy, customers arriving in a closedown time can not be served until the following setup time finishes. For the systems with interruptible setup/closedown times, we assume both the fully and almost observable cases, then derive equilibrium threshold strategies for the customers and analyze the stationary behavior of the systems. On the other hand, for the systems with insusceptible setup/closedown times, we only consider the fully observable case. We also illustrate the equilibrium thresholds and the social benefits for systems via numerical experiments. As far as we know, there is no work concerning equilibrium behavior of customers in queueing systems with setup/closedown times. Copyright Springer-Verlag 2010

Suggested Citation

  • Wei Sun & Pengfei Guo & Naishuo Tian, 2010. "Equilibrium threshold strategies in observable queueing systems with setup/closedown times," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(3), pages 241-268, September.
    • Handle: RePEc:spr:cejnor:v:18:y:2010:i:3:p:241-268
    DOI: 10.1007/s10100-009-0104-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-009-0104-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-009-0104-4?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. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Economou, Antonis & Logothetis, Dimitrios & Manou, Athanasia, 2022. "The value of reneging for strategic customers in queueing systems with server vacations/failures," European Journal of Operational Research, Elsevier, vol. 299(3), pages 960-976.
    2. Lian, Zhaotong & Gu, Xinhua & Wu, Jinbiao, 2016. "A re-examination of experience service offering and regular service pricing under profit maximization," European Journal of Operational Research, Elsevier, vol. 254(3), pages 907-915.
    3. Shuo Wang & Xiuli Xu, 2021. "Equilibrium strategies of the fluid queue with working vacation," Operational Research, Springer, vol. 21(2), pages 1211-1228, June.
    4. Antonis Economou & Athanasia Manou, 2013. "Equilibrium balking strategies for a clearing queueing system in alternating environment," Annals of Operations Research, Springer, vol. 208(1), pages 489-514, September.
    5. Gopinath Panda & Veena Goswami, 2022. "Equilibrium Joining Strategies of Positive Customers in a Markovian Queue with Negative Arrivals and Working Vacations," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1439-1466, September.
    6. Boudali, Olga & Economou, Antonis, 2012. "Optimal and equilibrium balking strategies in the single server Markovian queue with catastrophes," European Journal of Operational Research, Elsevier, vol. 218(3), pages 708-715.
    7. Jie Liu & Jinting Wang, 2017. "Strategic joining rules in a single server Markovian queue with Bernoulli vacation," Operational Research, Springer, vol. 17(2), pages 413-434, July.
    8. Wojciech M. Kempa & Dariusz Kurzyk, 2022. "Analysis of Non-Steady Queue-Length Distribution in a Finite-Buffer Model with Group Arrivals and Power Saving Mechanism with Setups," Energies, MDPI, vol. 15(22), pages 1-15, November.
    9. Wei Sun & Shiyong Li, 2014. "Equilibrium and optimal behavior of customers in Markovian queues with multiple working vacations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 694-715, July.
    10. Guo, Pengfei & Hassin, Refael, 2012. "Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers," European Journal of Operational Research, Elsevier, vol. 222(2), pages 278-286.
    11. Olga Boudali & Antonis Economou, 2013. "The effect of catastrophes on the strategic customer behavior in queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(7), pages 571-587, October.

    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. L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
    2. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    3. Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
    4. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    5. Fajardo, Val Andrei & Drekic, Steve, 2015. "Controlling the workload of M/G/1 queues via the q-policy," European Journal of Operational Research, Elsevier, vol. 243(2), pages 607-617.
    6. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    7. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    8. Odysseas Kanavetas & Barış Balcıog̃lu, 2022. "The “Sensitive” Markovian queueing system and its application for a call center problem," Annals of Operations Research, Springer, vol. 317(2), pages 651-664, October.
    9. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.
    10. Eliran Sherzer & Yoav Kerner, 2018. "Customers’ abandonment strategy in an M / G / 1 queue," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 65-87, October.
    11. Tesnim Naceur & Yezekael Hayel, 2020. "Deterministic state-based information disclosure policies and social welfare maximization in strategic queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 303-328, December.
    12. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    13. Laurens Debo & Uday Rajan & Senthil K. Veeraraghavan, 2020. "Signaling Quality via Long Lines and Uninformative Prices," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 513-527, May.
    14. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.
    15. Platz, Trine Tornøe & Østerdal, Lars Peter, 2017. "The curse of the first-in–first-out queue discipline," Games and Economic Behavior, Elsevier, vol. 104(C), pages 165-176.
    16. Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving upon Random Priority," Operations Research, INFORMS, vol. 49(4), pages 565-577, August.
    17. Stein, William E. & Rapoport, Amnon & Seale, Darryl A. & Zhang, Hongtao & Zwick, Rami, 2007. "Batch queues with choice of arrivals: Equilibrium analysis and experimental study," Games and Economic Behavior, Elsevier, vol. 59(2), pages 345-363, May.
    18. Jouini, Oualid & Dallery, Yves & Aksin, Zeynep, 2009. "Queueing models for full-flexible multi-class call centers with real-time anticipated delays," International Journal of Production Economics, Elsevier, vol. 120(2), pages 389-399, August.
    19. Luyi Yang & Laurens G. Debo & Varun Gupta, 2019. "Search Among Queues Under Quality Differentiation," Management Science, INFORMS, vol. 65(8), pages 3605-3623, August.
    20. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.

    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:cejnor:v:18:y:2010:i:3:p:241-268. 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.