Skip to main content
Erschienen in: Queueing Systems 1-2/2020

25.09.2019

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

verfasst von: Dhanya Shajin, A. Krishnamoorthy, A. N. Dudin, Varghese C. Joshua, Varghese Jacob

Erschienen in: Queueing Systems | Ausgabe 1-2/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.\) 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).\) 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\) are overbooked, is shown to yield a product form solution. For this case, an appropriate cost function is constructed and its properties investigated numerically.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Abouee-Mehrizi, H., Baron, O.: State-dependent M/G/1 queueing systems. Queueing Syst. 82(1–2), 121–148 (2016)CrossRef Abouee-Mehrizi, H., Baron, O.: State-dependent M/G/1 queueing systems. Queueing Syst. 82(1–2), 121–148 (2016)CrossRef
2.
Zurück zum Zitat Abouee-Mehrizi, H., Balcioglu, B., Baron, O.: Strategies for a centralized single product multiclass M/G/1 make-to-stock queue. Oper. Res. 60(4), 803–812 (2012)CrossRef Abouee-Mehrizi, H., Balcioglu, B., Baron, O.: Strategies for a centralized single product multiclass M/G/1 make-to-stock queue. Oper. Res. 60(4), 803–812 (2012)CrossRef
3.
Zurück zum Zitat Arivarignan, G., Elango, C., Arumugam, N.: A continuous review perishable inventory control system at service facilities. In: Artalejo, J.R., Krishnamoorthy, A. (eds.) Advances in Stochastic Modelling, pp. 29–40. Notable Publications, Newark (2002) Arivarignan, G., Elango, C., Arumugam, N.: A continuous review perishable inventory control system at service facilities. In: Artalejo, J.R., Krishnamoorthy, A. (eds.) Advances in Stochastic Modelling, pp. 29–40. Notable Publications, Newark (2002)
4.
Zurück zum Zitat Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003) Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003)
5.
Zurück zum Zitat Baek, J.W., Moon, S.K.: The \(M/M/1\) queue with a production–inventory system and lost sales. Appl. Math. Comput. 233, 534–544 (2014) Baek, J.W., Moon, S.K.: The \(M/M/1\) queue with a production–inventory system and lost sales. Appl. Math. Comput. 233, 534–544 (2014)
6.
Zurück zum Zitat Baek, J.W., Bae, Y.H., Lee, H.W., Ahn, S.: Continuous-type \((s, Q)\)-inventory model with an attached \(M/M/1\) queue and lost sales. Perform. Eval. 125, 68–79 (2018)CrossRef Baek, J.W., Bae, Y.H., Lee, H.W., Ahn, S.: Continuous-type \((s, Q)\)-inventory model with an attached \(M/M/1\) queue and lost sales. Perform. Eval. 125, 68–79 (2018)CrossRef
7.
Zurück zum Zitat Barron, Y., Perry, D., Stadje, W.: A make-to-stock production/inventory model with MAP arrivals and phase-type demands. Ann. Oper. Res. 241(1–2), 373–409 (2016)CrossRef Barron, Y., Perry, D., Stadje, W.: A make-to-stock production/inventory model with MAP arrivals and phase-type demands. Ann. Oper. Res. 241(1–2), 373–409 (2016)CrossRef
8.
Zurück zum Zitat Barron, Y.: A threshold policy in a Markov-modulated production system with server vacation: the case of continuous and batch supplies. Adv. Appl. Probab. 50(4), 1246–1274 (2018)CrossRef Barron, Y.: A threshold policy in a Markov-modulated production system with server vacation: the case of continuous and batch supplies. Adv. Appl. Probab. 50(4), 1246–1274 (2018)CrossRef
9.
Zurück zum Zitat Berman, O., Kaplan, E.H., Shimshak, D.G.: Deterministic approximations for inventory management at service facilities. IIE Trans. 25(5), 98–104 (1993)CrossRef Berman, O., Kaplan, E.H., Shimshak, D.G.: Deterministic approximations for inventory management at service facilities. IIE Trans. 25(5), 98–104 (1993)CrossRef
10.
Zurück zum Zitat Berman, O., Kim, E.: Stochastic models for inventory managements at service facilities. Commun. Stat. Stoch. Models 15(4), 695–718 (1999)CrossRef Berman, O., Kim, E.: Stochastic models for inventory managements at service facilities. Commun. Stat. Stoch. Models 15(4), 695–718 (1999)CrossRef
11.
Zurück zum Zitat Berman, O., Sapna, K.P.: Optimal service rates of a service facility with perishable inventory items. Nav. Res. Logist. 49, 464–482 (2002)CrossRef Berman, O., Sapna, K.P.: Optimal service rates of a service facility with perishable inventory items. Nav. Res. Logist. 49, 464–482 (2002)CrossRef
12.
Zurück zum Zitat Breuer, L.: A quintuple law for Markov additive processes with phase-type jumps. J. Appl. Probab. 47, 441–458 (2010)CrossRef Breuer, L.: A quintuple law for Markov additive processes with phase-type jumps. J. Appl. Probab. 47, 441–458 (2010)CrossRef
13.
Zurück zum Zitat Chakravarthy, S.R.: The batch Markovian arrival process: a review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–49. Notable Publications, Newark (2001) Chakravarthy, S.R.: The batch Markovian arrival process: a review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–49. Notable Publications, Newark (2001)
14.
Zurück zum Zitat Chakravarthy, S.R., Krishnamoorthy, A., Joshua, V.C.: Analysis of a multi-server retrial queue with search of customers from the orbit. Perform. Eval. 63, 776–798 (2006) CrossRef Chakravarthy, S.R., Krishnamoorthy, A., Joshua, V.C.: Analysis of a multi-server retrial queue with search of customers from the orbit. Perform. Eval. 63, 776–798 (2006) CrossRef
19.
Zurück zum Zitat Krishnamoorthy, A., Shajin, D., Lakshmy, B.: \(GI/M/1\) type queueing-inventory systems with postponed work, reservation, cancellation and common life time. Indian J. Pure Appl. Math. 47(2), 357–388 (2016)CrossRef Krishnamoorthy, A., Shajin, D., Lakshmy, B.: \(GI/M/1\) type queueing-inventory systems with postponed work, reservation, cancellation and common life time. Indian J. Pure Appl. Math. 47(2), 357–388 (2016)CrossRef
20.
Zurück zum Zitat Krishnamoorthy, A., Lakshmy, B., Manikandan, R.: A survey on inventory models with positive service time. OPSEARCH 48(2), 153–169 (2011)CrossRef Krishnamoorthy, A., Lakshmy, B., Manikandan, R.: A survey on inventory models with positive service time. OPSEARCH 48(2), 153–169 (2011)CrossRef
22.
Zurück zum Zitat Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modellings. ASA-SIAM, Philadelphia (1999)CrossRef Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modellings. ASA-SIAM, Philadelphia (1999)CrossRef
23.
Zurück zum Zitat Lucatoni, D.: New results on the single server queue with a batch Markovian arrival process. Stoch. Models 7, 1–46 (1991)CrossRef Lucatoni, D.: New results on the single server queue with a batch Markovian arrival process. Stoch. Models 7, 1–46 (1991)CrossRef
24.
Zurück zum Zitat Melikov, A.Z., Molchanov, A.A.: Stock optimization in transportation/storage systems. Cybern. Syst. Anal. 28(3), 484–487 (1992)CrossRef Melikov, A.Z., Molchanov, A.A.: Stock optimization in transportation/storage systems. Cybern. Syst. Anal. 28(3), 484–487 (1992)CrossRef
25.
Zurück zum Zitat Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981). (1994 version is Dover Edition) Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981). (1994 version is Dover Edition)
26.
Zurück zum Zitat Ramaswami, V.: The \(N/G/1\) queue and its detailed analysis. J. Appl. Probab. 12, 222–261 (1980)CrossRef Ramaswami, V.: The \(N/G/1\) queue and its detailed analysis. J. Appl. Probab. 12, 222–261 (1980)CrossRef
27.
Zurück zum Zitat Saffari, M., Asmussen, S., Haji, R.: The M/M/1 queue with inventory, lost sale and general lead times. Queueing Syst. 75, 65–77 (2013)CrossRef Saffari, M., Asmussen, S., Haji, R.: The M/M/1 queue with inventory, lost sale and general lead times. Queueing Syst. 75, 65–77 (2013)CrossRef
28.
Zurück zum Zitat Schwarz, M., Sauer, C., Daduna, H., Kulik, R., Szekli, R.: M/M/1 queueing systems with inventory. Queueing Syst. 54, 55–78 (2006)CrossRef Schwarz, M., Sauer, C., Daduna, H., Kulik, R., Szekli, R.: M/M/1 queueing systems with inventory. Queueing Syst. 54, 55–78 (2006)CrossRef
29.
Zurück zum Zitat Schwarz, M., Daduna, H.: Queueing systems with inventory management with random lead times and with backordering. Math. Methods Oper. Res. 64, 383–414 (2006)CrossRef Schwarz, M., Daduna, H.: Queueing systems with inventory management with random lead times and with backordering. Math. Methods Oper. Res. 64, 383–414 (2006)CrossRef
30.
Zurück zum Zitat Schwarz, M., Wichelhaus, C., Daduna, H.: Product form models for queueing networks with an inventory. Stoch. Models 23(4), 627–663 (2007)CrossRef Schwarz, M., Wichelhaus, C., Daduna, H.: Product form models for queueing networks with an inventory. Stoch. Models 23(4), 627–663 (2007)CrossRef
31.
Zurück zum Zitat Shajin, D., Benny, B., Deepak, T.G., Krishnamoorthy, A.: A relook at queueing-inventory system with reservation, cancellation and common life time. Commun. Appl. Anal. 20, 545–574 (2016) Shajin, D., Benny, B., Deepak, T.G., Krishnamoorthy, A.: A relook at queueing-inventory system with reservation, cancellation and common life time. Commun. Appl. Anal. 20, 545–574 (2016)
33.
Zurück zum Zitat Shajin, D., Krishnamoorthy, A., Melikov, A.Z.: On partial and complete blocking set of states in queueing-inventory model. Appl. Comput. Math. 18(2), 189–201 (2019) Shajin, D., Krishnamoorthy, A., Melikov, A.Z.: On partial and complete blocking set of states in queueing-inventory model. Appl. Comput. Math. 18(2), 189–201 (2019)
34.
Zurück zum Zitat Shajin, D., Manikandan, R., Lakshmy, B., Krishnamoorthy, A.: MAP/PH/1 Queueing-inventory with common life time and Markovian lead time. Oper. Res. Int. J. (under review) Shajin, D., Manikandan, R., Lakshmy, B., Krishnamoorthy, A.: MAP/PH/1 Queueing-inventory with common life time and Markovian lead time. Oper. Res. Int. J. (under review)
35.
Zurück zum Zitat Sigman, K., Simchi-Levi, D.: Light traffic heuristic for an M/G/1 queue with limited inventory. Ann. Oper. Res. 40, 371–380 (1992)CrossRef Sigman, K., Simchi-Levi, D.: Light traffic heuristic for an M/G/1 queue with limited inventory. Ann. Oper. Res. 40, 371–380 (1992)CrossRef
Metadaten
Titel
On a queueing-inventory system with advanced reservation and cancellation for the next K time frames ahead: the case of overbooking
verfasst von
Dhanya Shajin
A. Krishnamoorthy
A. N. Dudin
Varghese C. Joshua
Varghese Jacob
Publikationsdatum
25.09.2019
Verlag
Springer US
Erschienen in
Queueing Systems / Ausgabe 1-2/2020
Print ISSN: 0257-0130
Elektronische ISSN: 1572-9443
DOI
https://doi.org/10.1007/s11134-019-09631-0

Weitere Artikel der Ausgabe 1-2/2020

Queueing Systems 1-2/2020 Zur Ausgabe