A stochastic inventory system with postponed demands

Performance Evaluation

Volumn 66, Issue 1, 2009, Pages 47-58

  Sivakumar, B ^a   Arivarignan, G ^a  

^a MADURAI KAMARAJ UNIVERSITY   (India)

Author keywords

(s, S) policy; Continuous review; Markovian arrival process; Negative demands; Postponed demands

Indexed keywords

INVENTORY CONTROL; PACKET NETWORKS; PROBABILITY DISTRIBUTIONS; RISK ASSESSMENT;

(S, S) POLICY; CONTINUOUS REVIEW; MARKOVIAN ARRIVAL PROCESS; NEGATIVE DEMANDS; POSTPONED DEMANDS;

LAKES;

EID: 54949135703     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2008.08.001     Document Type: Article

References (32)

1. Artalejo J.R. G-networks: A versatile approach for work removal in queueing networks. European Journal of Operational Research 126 (2000) 233-249
2. Berman O., Kaplan E.H., and Shimshak D.G. Deterministic approximations for inventory management at service facilities. IIE Transactions 25 (1993) 98-104
3. Chakravarthy S.R., and Daniel J.K. A Markovian inventory system with random shelf time and back orders. Computers & Industrial Engineering 47 4 (2004) 315-337
4. Chao X., Miyazawa M., and Pinedo M. Queueing Networks: Customers, Signal and Product Form Solutions (1999), Wiley, Chichester
5. Deepak T.G., Joshua V.C., and Krishnamoorthy A. Queues with postponed work. TOP (Spanish Journal of OR & Statistics) 12 2 (2004) 375-398
6. Fourneau J.M., Gelenbe E., and Suros R. G-networks with multiple classes of positive and negative customers. Theoretical Computer Science (1996) 141-156
7. Fourneau J.M., and Gelenbe E. Flow equivalence and stochastic equivalence in G-networks. Computational Management Science 1 2 (2004) 179-192
8. Gelenbe E. Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux. Comptes-Rendus de I' Academie Sciences de Paris des 309 Série II (1989) 979-982
9. Gelenbe E. Random neural networks with positive and negative signals and product form solution. Neural Computation 1 4 (1989) 502-510
10. Gelenbe E. Production-form queueing networks with negative and positive customers. Journal of Applied Probability 30 (1991) 742-748
11. Gelenbe E. G-networks with instantaneous customer movement. Journal of Applied Probability 30 3 (1993) 742-748
12. Gelenbe E. G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7 (1993) 335-342
13. Gelenbe E. G-networks: An unifying model for queuing networks and neural networks. Annals of Operations Research 48 1-4 (1994) 433-461
14. Gelenbe E., and Fourneau J.M. G-Networks with resets. Proc. IFIP WG 7.3/ACM-SIGMETRICS Performance'02 Conf., Rome, Italy, October 2002. Performance Evaluation 49 (2002) 179-192
15. Gelenbe E., and Hussain K. Learning in the multiple class random neural network. IEEE Transaction on Neural Networks 13 6 (2002) 1257-1267
16. Gelenbe E., and Labed A. G-networks with multiple classes of signals and positive customers. European Journal of Operations Research 108 2 (1998) 293-305
17. Gelenbe E., and Pujolle G. Introduction to Queueing Networks. second edition (1998), Wiley, Chichester
18. Gelenbe E., and Schassberger M. Stability of product form G-Networks. Probability in the Engineering and Informational Sciences 6 (1992) 271-276
19. Goyal S.K., and Giri B.C. Recent trends in modeling of deteriorating inventory. European Journal of Operational Research 134 1 (2001) 1-16
20. Kalpakam S., and Shanthi S. A perishable inventory system with modified (S-1, S) policy and arbitrary processing times. Computers & Operations Research 28 5 (2001) 453-471
21. Kalpakam S., and Shanthi S. A continuous review perishable system with renewal demands. Annals of Operations Research 143 1 (2006) 211-225
22. Kalpakam S., and Arivarignan G. Inventory system with random supply quantity. OR Spektrum 12 (1990) 139-145
23. Krishnamoorthy A., and Mohammad E.I. (s, S) inventory system with postponed demands. Stochastic Analysis and Applications 22 3 (2004) pp. 827842
24. Liu L., and Yang T. An (s, S) random lifetime inventory model with a positive lead time. European Journal of Operational Research 113 (1999) 52-63
25. Nahmias S. Perishable inventory theory: A review. Operations Research 30 (1982) 680-708
26. Neuts M.F. Matrix-geometric Solutions in Stochastic Models: An Algorithmic Approach (1994), Dover Publication Inc., New York
27. Neuts M.F. Algorithmic Probability : A Collection of Problems (1995), Chapman & Hall, London
28. Raafat F. A survey of literature on continuously deteriorating inventory models. Journal of Operational Research Society 42 (1991) 27-37
29. Ross S.M. Introduction to Probability Models (2000), Harcourt Asia PTE Ltd, Singapore
30. Shah N.H., and Shah Y.K. Literature survey on inventory models for deteriorating items. Ekonomski anali 44 (2000) 221-237
31. Sivakumar B., and Arivarignan G. A perishable inventory system at service facilities with negative customers. International Journal of Information and Management Sciences 17 2 (2006) 1-18
32. Yadavalli V.S.S., CdeW V.S., Strashein J.J., and Udayabakaran S. A single product perishing inventory model with demand interaction. ORiON 20 (2004) 109-124