CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Markov Process for Service Facility systems with perishable inventory and analysis of a single server queue with reneging – Stochastic Model

by M. Geetha Rani, C. Elango
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 15
Year of Publication: 2012
Authors: M. Geetha Rani, C. Elango
10.5120/6340-8619

M. Geetha Rani, C. Elango . Markov Process for Service Facility systems with perishable inventory and analysis of a single server queue with reneging – Stochastic Model. International Journal of Computer Applications. 44, 15 ( April 2012), 18-23. DOI=10.5120/6340-8619

@article{ 10.5120/6340-8619,
author = { M. Geetha Rani, C. Elango },
title = { Markov Process for Service Facility systems with perishable inventory and analysis of a single server queue with reneging – Stochastic Model },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 15 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number15/6340-8619/ },
doi = { 10.5120/6340-8619 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:35:39.356789+05:30
%A M. Geetha Rani
%A C. Elango
%T Markov Process for Service Facility systems with perishable inventory and analysis of a single server queue with reneging – Stochastic Model
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 15
%P 18-23
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we develop a supply network model for a service facility system with perishable inventory (on hand) by considering a two dimensional stochastic process of the form (L, X) = , where L (t) is the level of the on hand inventory and X (t) is the number of customers at time t. The inter-arrival time to the service station is assumed to be exponentially distributed with mean 1/?. The service time for each customer is exponentially distributed with mean 1/ µ. The maximum inventory level is S and the maximum capacity of the waiting space is N. The replenishment process is assumed to be (S-1, S) with a replenishment of only one unit at any level of the inventory. Lead time is exponentially distributed with parameter ?. The items are replenished at a rate of ? whose mean replenishment time is 1/?. Item in inventory is perishable when it's utility drops to zero or the inventory item become worthless while in storage. Perishable of any item occurs at a rate of ?. Once entered a queue, the customer may choose to leave the queue at a rate of ? if they have not been served after a certain time (reneging). The steady state probability distributions for the system states are obtained. A numerical example is provided to illustrate the method described in the model.

References
  1. Berman O. and E. Kim, Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time, Math Meth Oper Res, 60 (2004), 497–521.
  2. Berman O. and E. Kim, Dynamic order replenishment policy in internet-based supply chains, Math Meth Oper Res, 53 (2001), 371–390.
  3. Berman O. and K. P. Sapna, Optimal service rates of a service facility with perishable inventory items, Naval Res Logist, 49 (2002), 464–482.
  4. Berman, O. Kaplan, E. H. and Shimshak, D. G. (1993), Deterministic approximations for inventory management at service facilities, IIE transactions, 25, 98-104.
  5. Berman, O. Kim, E. (1999), Stochastic inventory policies for inventory management at service facilities, Stochastic Models, 15, 695 -718.
  6. Berman, O. Sapna, k. P. (2000), Inventory management at service facilities for systems with arbitrarily distributed service times, stochastic models, 16, 343 – 360.
  7. Chi-nang tang and Raymond W. Yeung, A graph-theoretic Approach to Queuing Analysis. Part I – Theory, Communication Stat. – Stochastic Models, 15(5), 791 -824 (1999).
  8. Economopoulos, A. and Kouikoglou, V. (2008). Analysis of a Simple CONWIP System with Impatient Customers. Proceedings of the 4th Annual Conference on Automation Science and Engineering (CASE 2008), Washington DC, USA.
  9. Elango. C, Inventory System of Service Facilities. Ph. D thesis, Madurai Kamaraj University, Madurai, 2002.
  10. Guo, P. and Zipkin, P. 2007. Analysis and Comparison of Queues with Different Levels of Delay Information. Management Science, 53:962-970.
  11. Gurler, U. and Ozkaya, Y. B. (2008). Analysis of the (s, S) Policy for Perishables with a Random Shelf Life. IIE Transactions, 40:759–781.
  12. He Q. M. , E. M. Jewkes and J. Buzacott, Optimal and near-optimal inventory policies for a make to order inventory-production system, Eur. J Opr. Res, 141 (2002), 113-132.
  13. Karaesmen, I. , Scheller-Wolf, A. and Deniz, B (2011). Managing Perishable and Aging Inventories: Review and Future Research Directions. in Planning Production and Inventories in the Extended Enterprise, A State of the Art Handbook, Vol. 1, 393{438, Kempf, K. , Keskinocak, P. and Uzsoy,P. (eds. ), International Series in Operations Research and Management Science, Springer.
  14. Maike Schwarz et al. etc. M/M/1 Queuing systems with inventory – Springer – Queuing System (2006) 54:55-78 DOI 10. 1007/s11134-006-8710-5.
  15. Olsson, F. and Tydesjo, P. (2010). Inventory Problems with Perishable Items: Fixed Lifetimes and Backlogging. European Journal of Operational Research, 202:131–137.
  16. Rasoul Haji et al. Inventory and Service System in a Two-Echelon Supply Chain with One-for-One Ordering Policy, Journal of Industrial and Systems Engineering Vol. 5, No. 1, pp 337-347, Spring 2011.
  17. Saffari, M. R. Haji and F. Hassanzadeh, A queuing system with inventory and mixed exponentially distributed lead times, Int. J Adv Manuf. Technol. , DOI 10. 1007/s00170-010-2883-0.
  18. Saffari. M. and R. Haji, Queuing system with inventory for two-echelon supply chain, CIE Int. Conference, (2009), 835–838.
  19. Satheesh R Kumar and C. Elango. Article: Markov Decision Processes for Service Facility Systems with Perishable Inventory, International Journal of Computer Applications 9(4):14 – 17, November 2010. Published by the Foundation of Computer Science.
  20. Schwarz. M. and H. Daduna, Queuing systems with inventory management with random lead times and with backordering, Math Meth Oper Res, 64 (2006), 383–414.
  21. Schwarz. M. , C. Sauer, H. Daduna, R. Kulik and R. Szekli, M/M/1 Queuing systems with inventory, Queuing System, 54 (2006), 55–78.
  22. Sigman. K. and D. Simchi-Levi, Light traffic heuristic for an M/G/1 queue with limited inventory, Ann Oper Res, 40 (1992), 371–380.
Index Terms

Computer Science
Information Sciences

Keywords

Markov Process Service Facility System Stochastic Model Inventory Control Queue-inventory Model Equilibrium Distribution

Powered by PhDFocusTM