Skip to main content

GI/M/1 type queueing-inventory systems with postponed work, reservation, cancellation and common life time

Abstract

In this paper we analyze two single server queueing-inventory systems in which items in the inventory have a random common life time. On realization of common life time, all customers in the system are flushed out. Subsequently the inventory reaches its maximum level S through a (positive lead time) replenishment for the next cycle which follows an exponential distribution. Through cancellation of purchases, inventory gets added until their expiry time; where cancellation time follows exponential distribution. Customers arrive according to a Poisson process and service time is exponentially distributed. On arrival if a customer finds the server busy, then he joins a buffer of varying size. If there is no inventory, the arriving customer first try to queue up in a finite waiting room of capacity K. Finding that at full, he joins a pool of infinite capacity with probability γ (0 < γ < 1); else it is lost to the system forever. We discuss two models based on ‘transfer’ of customers from the pool to the waiting room / buffer. In Model 1 when, at a service completion epoch the waiting room size drops to preassigned number L − 1 (1 < L < K) or below, a customer is transferred from pool to waiting room with probability p (0 < p < 1) and positioned as the last among the waiting customers. If at a departure epoch the waiting room turns out to be empty and there is at least one customer in the pool, then the one ahead of all waiting in the pool gets transferred to the waiting room with probability one. We introduce a totally different transfer mechanism in Model 2: when at a service completion epoch, the server turns idle with at least one item in the inventory, the pooled customer is immediately taken for service. At the time of a cancellation if the server is idle with none, one or more customers in the waiting room, then the head of the pooled customer go to the buffer directly for service. Also we assume that no customer joins the system when there is no item in the inventory. Several system performance measures are obtained. A cost function is discussed for each model and some numerical illustrations are presented. Finally a comparison of the two models are made.

This is a preview of subscription content, access via your institution.

References

  1. G. Arivarignan, C. Elango and N. Arumugam, A continuous review perishable inventory control system at service facilities, In: Artalejo J. R., Krishnamoorthy A. (eds.) Advances in Stochastic Modelling, pp. 2940. Notable Publications, NJ, USA. (2002), 29-40.

    Google Scholar 

  2. O. Berman, E. H. Kaplan and D. G. Shimshak, Deterministic approximations for inventory management at service facilities, IIE Trans., 25(5) (1993), 98–104.

    Article  Google Scholar 

  3. O. Berman and E. Kim, Stochastic models for inventory managements at service facilities, Commun. Statist. Stochastic Models, 15(4) (1999), 695–718.

    Article  MathSciNet  MATH  Google Scholar 

  4. O. Berman and K. P. Sapna, Optimal service rates of a service facility with perishable inventory items, Naval Research Logistic, 49 (2002), 464–482.

    Article  MathSciNet  MATH  Google Scholar 

  5. T. G. Deepak, V. C. Joshua and A. Krishnamoorthy, Queues with postponed work, TOP-Spanish Journal of Statistics and Operational Research, 12 (2004), 375–398.

    MathSciNet  MATH  Google Scholar 

  6. R. Krenzler and H. Daduna, Loss systems in a random environment steady-state analysis, Queueing Syst, (2014). DOI 10.1007/s11134-014-9426-6.

    Google Scholar 

  7. A. Krishnamoorthy, Dhanya Shajin and B. Lakshmy, On a queueing-inventory with reservation, cancellation, common life time and retrial, Annals of Operation Research, (2015). DOI 10.1007/s10479-015-1849-x.

    Google Scholar 

  8. A. Krishnamoorthy, V. C. Narayanan, T. G. Deepak and K. Vineetha, Effective utilization of server idle time in an (s, S) inventory with positive service time, Journal of Applied Mathematics and Stochastic Analysis, (2006). doi:10.1155/JAMSA/2006/69068.

    Google Scholar 

  9. A. Krishnamoorthy and N. C. Viswanath, Stochastic decomposition in production inventory with service time, EJOR, (2013). http://dx.doi.org/10.1016/j.ejor.2013.01.041

    Google Scholar 

  10. M. F. Neuts, Matrix-geometric solutions in stochastic models: an algorithmic approach, The Johns Hopkins University Press, Baltimore, (1981), [1994 version is Dover Edition].

    MATH  Google Scholar 

  11. M. F. Neuts, Structured stochastic matrices of M/G/1 type and their applications: Marcel Dekkar (1989).

    MATH  Google Scholar 

  12. S. Otten, R. Krenzler and H. Daduna, Integrated models for production-inventory systems, (2014), http://preprint.math.uni-hamburg.de/public/papers/prst/prst2014-01.pdf.

    Google Scholar 

  13. M. Saffari, S. Asmussen and R. Haji, The M/M/1 queue with inventory, lost sale and general lead times, (2013), Queueing Systems, DOI:10.1007/s11134-012-9337-3.

    MATH  Google Scholar 

  14. M. Schwarz, C. Sauer, H. Daduna, R. Kulik and R. Szekli, M/M/1 queueing systems with inventory, Queueing Syst., 54 (2006), 55–78.

    Article  MathSciNet  MATH  Google Scholar 

  15. M. Schwarz and H. Daduna, Queueing systems with inventory management with random lead times and with backordering, Mathematical Methods of Operations Research, 64 (2006), 383–414.

    Article  MathSciNet  MATH  Google Scholar 

  16. M. Schwarz, C. Wichelhaus and H. Daduna, Product form models for queueing networks with an inventory, Stochastic Models, 23(4) (2007), 627–663.

    Article  MathSciNet  MATH  Google Scholar 

  17. K. Sigman and D. Simchi-Levi, Light traffic heuristic for an M/G/1 queue with limited inventory, Annals of Operation Research, 40 (1992), 371–380.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Krishnamoorthy.

Additional information

Research supported by Kerala State Council for Science, Technology & Environment (No. 001/KESS/2013/CSTE).

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

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, 357–388 (2016). https://doi.org/10.1007/s13226-016-0192-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-016-0192-5

Key words