IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v94y2020i1d10.1007_s11134-019-09631-0.html
   My bibliography  Save this article

On a queueing-inventory system with advanced reservation and cancellation for the next K time frames ahead: the case of overbooking

Author

Listed:
  • Dhanya Shajin

    (Sree Narayana College, Chempazhanthy)

  • A. Krishnamoorthy

    (CMS College)

  • A. N. Dudin

    (Belarusian State University
    Peoples Friendship University of Russia (RUDN University))

  • Varghese C. Joshua

    (CMS College)

  • Varghese Jacob

    (Government College)

Abstract

We analyse the evolution of a system designed for reservation of some items in advance (for example, seats in aircrafts or trains or bus) by customers arriving at random moments. The reservation has to be done by the server in one of the K time frames. At the beginning of the pth time frame, the inventoried items in it (as well as those sold from it earlier) have life time distribution which is a p-fold convolution of a phase-type distribution with itself, for $$1 \le p \le K.$$1≤p≤K. Cancellation of reserved items is possible before the expiry of their life. Distributions characterizing the service and inter-cancellation times are assumed to be independent exponential random variables and the customer arrivals are according to a Markovian arrival process. The number of items for reservation, available at the beginning of each time frame, is finite. If, at the commencement of service of a customer, the item in the required time frame is not available, the reservation may still be possible, through overbooking. Overbooking up to a maximum fixed level is permitted for each time frame. If, for the required day, the overbooked item is available, the customer is served the same. If this too is not available, he is asked to give alternatives. If none of his alternatives can be met, he is provided with a reservation for the time frame (day) for which one is available. If that too is not available, then he will have to wait until the expiry of one time frame; in the last case all remaining customers will have to wait. On expiry of one phase distribution, the time frames are renumbered and a new time frame with a K-fold convolution of the phase-type distribution is added $$(0 \leftarrow 1 \leftarrow 2 \leftarrow \cdots \leftarrow K-1 \leftarrow K \leftarrow K+1).$$(0←1←2←⋯←K-1←K←K+1). All overbooked customers present in the recently expired time frame are provided with a reservation in the newly added time frame (which has, at that epoch, a life time of a K-fold convolution of the phase-type distribution). This system is analysed and illustrated through numerical experiments. The special case of Poisson arrival, coupled with blocking of arrivals when all time frames $$1, 2, \ldots , K$$1,2,…,K are overbooked, is shown to yield a product form solution. For this case, an appropriate cost function is constructed and its properties investigated numerically.

Suggested Citation

  • Dhanya Shajin & A. Krishnamoorthy & A. N. Dudin & Varghese C. Joshua & Varghese Jacob, 2020. "On a queueing-inventory system with advanced reservation and cancellation for the next K time frames ahead: the case of overbooking," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 3-37, February.
    • Handle: RePEc:spr:queues:v:94:y:2020:i:1:d:10.1007_s11134-019-09631-0
    DOI: 10.1007/s11134-019-09631-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-019-09631-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-019-09631-0?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. A. Krishnamoorthy & Dhanya Shajin & B. Lakshmy, 2016. "On a queueing-inventory with reservation, cancellation, common life time and retrial," Annals of Operations Research, Springer, vol. 247(1), pages 365-389, December.
    2. Hossein Abouee-Mehrizi & Opher Baron, 2016. "State-dependent M/G/1 queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 121-148, February.
    3. Maike Schwarz & Hans Daduna, 2006. "Queueing systems with inventory management with random lead times and with backordering," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(3), pages 383-414, December.
    4. Yonit Barron & David Perry & Wolfgang Stadje, 2016. "A make-to-stock production/inventory model with MAP arrivals and phase-type demands," Annals of Operations Research, Springer, vol. 241(1), pages 373-409, June.
    5. O. Berman & K.P. Sapna, 2002. "Optimal service rates of a service facility with perishable inventory items," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(5), pages 464-482, August.
    6. Krishnamoorthy, A. & Viswanath, Narayanan C., 2013. "Stochastic decomposition in production inventory with service time," European Journal of Operational Research, Elsevier, vol. 228(2), pages 358-366.
    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. Dhanya Shajin & A. Krishnamoorthy, 2021. "On a queueing-inventory system with impatient customers, advanced reservation, cancellation, overbooking and common life time," Operational Research, Springer, vol. 21(2), pages 1229-1253, June.
    2. Baek, Jung Woo & Bae, Yun Han, 2022. "A queuing-inventory model for manufacturing systems with fluid-type inventory," Omega, Elsevier, vol. 111(C).
    3. A. Krishnamoorthy & Dhanya Shajin & B. Lakshmy, 2016. "GI/M/1 type queueing-inventory systems with postponed work, reservation, cancellation and common life time," Indian Journal of Pure and Applied Mathematics, Springer, vol. 47(2), pages 357-388, June.
    4. Dhanya Shajin & A. Krishnamoorthy & R. Manikandan, 2022. "On a queueing-inventory system with common life time and Markovian lead time process," Operational Research, Springer, vol. 22(1), pages 651-684, March.
    5. Dhanya Shajin & Jaison Jacob & A. Krishnamoorthy, 2022. "On a queueing inventory problem with necessary and optional inventories," Annals of Operations Research, Springer, vol. 315(2), pages 2089-2114, August.
    6. A. Krishnamoorthy & R. Manikandan & B. Lakshmy, 2015. "A revisit to queueing-inventory system with positive service time," Annals of Operations Research, Springer, vol. 233(1), pages 221-236, October.
    7. Agassi Melikov & Ramil Mirzayev & Sajeev S. Nair, 2022. "Double Sources Queuing-Inventory System with Hybrid Replenishment Policy," Mathematics, MDPI, vol. 10(14), pages 1-16, July.
    8. Jung Woo Baek, 2024. "On the Control Policy of a Queuing–Inventory System with Variable Inventory Replenishment Speed," Mathematics, MDPI, vol. 12(2), pages 1-19, January.
    9. S. R. Chakravarthy & Arunava Maity & U. C. Gupta, 2017. "An ‘(s, S)’ inventory in a queueing system with batch service facility," Annals of Operations Research, Springer, vol. 258(2), pages 263-283, November.
    10. Yuying Zhang & Dequan Yue & Wuyi Yue, 2022. "A queueing-inventory system with random order size policy and server vacations," Annals of Operations Research, Springer, vol. 310(2), pages 595-620, March.
    11. Agassi Melikov & Ramil Mirzayev & Janos Sztrik, 2023. "Double-Sources Queuing-Inventory Systems with Finite Waiting Room and Destructible Stocks," Mathematics, MDPI, vol. 11(1), pages 1-16, January.
    12. Barron, Yonit, 2023. "A stochastic card balance management problem with continuous and batch-type bilateral transactions," Operations Research Perspectives, Elsevier, vol. 10(C).
    13. Youseef Alotaibi, 2016. "Business process modelling challenges and solutions: a literature review," Journal of Intelligent Manufacturing, Springer, vol. 27(4), pages 701-723, August.
    14. Kangzhou Wang & Shouchang Chen & Zhibin Jiang & Weihua Zhou & Na Geng, 2021. "Capacity Allocation of an Integrated Production and Service System," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2765-2781, August.
    15. 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).
    16. Fathi, Mahdi & Khakifirooz, Marzieh & Diabat, Ali & Chen, Huangen, 2021. "An integrated queuing-stochastic optimization hybrid Genetic Algorithm for a location-inventory supply chain network," International Journal of Production Economics, Elsevier, vol. 237(C).
    17. Balcıõglu, Barış & Varol, Yãgız, 2022. "Fair and profitable: How pricing and lead-time quotation policies can help," European Journal of Operational Research, Elsevier, vol. 299(3), pages 977-986.
    18. Walid W. Nasr, 2022. "Inventory systems with stochastic and batch demand: computational approaches," Annals of Operations Research, Springer, vol. 309(1), pages 163-187, February.
    19. Jalili Marand, Ata & Li, Hongyan & Thorstenson, Anders, 2019. "Joint inventory control and pricing in a service-inventory system," International Journal of Production Economics, Elsevier, vol. 209(C), pages 78-91.
    20. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.

    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:queues:v:94:y:2020:i:1:d:10.1007_s11134-019-09631-0. 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.