Matrix-geometric method for the analysis of a queuing system with perishable inventory. (English. Russian original) Zbl 1483.90044
Autom. Remote Control 82, No. 12, 2169-2182 (2021); translation from Avtom. Telemekh. 2021, No. 12, 154-169 (2021).
Summary: Markov models of queuing systems with perishable stocks and an infinite buffer are studied using two replenishment policies. In one of them, the volume of orders is constant, while the other depends on the current level of stocks. Customers can join the queue even when the inventory level is zero. After the service is completed, customers either receive supplies or leave the system without receiving them, while the duration of their service depends on whether the customer has received supplies or not. The conditions for the ergodicity of the constructed two-dimensional Markov chains are obtained, and the matrix-geometric method is used to calculate their steady-state distributions. Formulas are found for finding the characteristics of the system using the indicated replenishment policies, and the results of numerical experiments are given.
MSC:
| 90B22 | Queues and service in operations research |
| 60K25 | Queueing theory (aspects of probability theory) |
| 90B05 | Inventory, storage, reservoirs |
References:
| [1] | Krishnamoorthy, A., Shajin, D., and Narayanan, W., Inventory with positive service time: a survey, in Advanced Trends in Queueing Theory. Series of Books “Mathematics and Statistics” Sciences, Anisimov, V. and Limnios, N., Eds., London: ISTE &Wiley, 2021. V. 2, pp. 201-238. |
| [2] | Bakker, M.; Riezebos, J.; Teunter, R. H., Review of inventory systems with deterioration since 2001, Eur. J. Oper. Res., 221, 275-284 (2012) · Zbl 1253.90017 · doi:10.1016/j.ejor.2012.03.004 |
| [3] | Nahmias, S., Perishable Inventory Theory (2011), Heidelberg: Springer, Heidelberg · doi:10.1007/978-1-4419-7999-5 |
| [4] | Ko, S. S.; Kang, J.; Kwon, E-J., An \((s,S)\) inventory model with level-dependent G/M/1 type structure, J. Ind. & Manage. Opt., 12, 2, 609-624 (2016) · Zbl 1346.90037 · doi:10.3934/jimo.2016.12.609 |
| [5] | Ko, S.S., A nonhomogeneous quasi-birth-death process approach for an \((s,S)\) policy for a perishable inventory system with retrial demands, J. Ind. & Manage. Opt.. doi:10.3934/jimo.2019009 · Zbl 1463.60101 |
| [6] | Kocer, U. U.; Yalcin, B., Continuous review \((s,Q)\) inventory system with random lifetime and two demand classes, OPSEARCH, 57, 104-118 (2020) · Zbl 07182112 · doi:10.1007/s12597-019-00393-0 |
| [7] | Al Hamadi, H. M.; Sangeetha, N.; Sivakumar, B., Optimal control of service parameter for a perishable inventory system maintained at service facility with impatient customers, Ann. Oper. Res., 233, 3-23 (2015) · Zbl 1325.90024 · doi:10.1007/s10479-014-1627-1 |
| [8] | Amirthakodi, M.; Radhamani, V.; Sivakumar, B., A perishable inventory system with service facility and feedback customers, Ann. Oper. Res., 233, 25-55 (2015) · Zbl 1325.90025 · doi:10.1007/s10479-015-1821-9 |
| [9] | Jeganathan, K.; Yadavalli, V. S.S., A finite source perishable inventory system with second optional service and server interruptions, ORiON, 32, 1, 23-53 (2016) · doi:10.5784/32-1-528 |
| [10] | Krishnamoorthy, A.; Shajin, D.; Lakshmy, B., On a queueing-inventory with reservation, cancellation, common life time and retrial, Ann. Oper. Res., 247, 365-389 (2016) · Zbl 1358.90031 · doi:10.1007/s10479-015-1849-x |
| [11] | Krishnamoorthy, A.; Shajin, D.; Lakshmy, B., G/M/1 type queueing-inventory system with postponed, cancellation and common life time, Indian J. Pure& Appl. Math., 47, 2, 357-388 (2016) · Zbl 1351.90081 · doi:10.1007/s13226-016-0192-5 |
| [12] | Shajin, D., Krishnamoorthy, A., and Manikandan, R., On a queueing-inventory system with common life time and Markovian lead time process, Oper. Res.. doi:10.1007/s12351-020-00560-y · Zbl 1387.90022 |
| [13] | Laxmi, P. V.; Soujanya, M. L., Perishable inventory model with retrial demands, negative customers and multiple working vacations, Int. J. Math. Model. & Comput., 7, 4, 239-254 (2017) |
| [14] | Laxmi, P. V.; Soujanya, M. L., Perishable inventory system with service interruptions, retrial demands and negative customers, Appl. Math. & Comput., 262, 102-110 (2015) · Zbl 1410.90017 |
| [15] | Reshmi, P. S.; Jose, K. P., A queueing-inventory system with perishable items and retrial of customers, Malaya J. Mat., 7, 2, 165-170 (2019) · doi:10.26637/MJM0702/0006 |
| [16] | Reshmi, P.S. and Jose, K.P., A production inventory model with deteriorating items and retrial demands, OPSEARCH. doi:10.1007/s12597-020-00471-8 · Zbl 07497910 |
| [17] | Jajaraman, B., Sivakumar, B., and Arivarignan, G., A perishable inventory system with postponed demands and multiple server vacations, Model. Simul. Eng. (Hindawi Publ. Corp.), 2012, vol. 2012, article ID 620960. |
| [18] | Melikov, A. Z.; Molchanov, A. A., Stock optimization in transport/storage systems, Cybernetics, 27, 3, 484-487 (1992) · Zbl 0875.90303 |
| [19] | Neuts, M. F., Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (1981), Baltimore: John Hopkins Univ., Baltimore · Zbl 0469.60002 |
| [20] | Krishnamoorthy, A.; Manikandan, R.; Lakshmy, B., Revisit to queueing-inventory system with positive service time, Ann. Oper. Res., 233, 221-236 (2015) · Zbl 1327.90050 · doi:10.1007/s10479-013-1437-x |
| [21] | Zhang, Y., Yue, D., and Yue, W., A queueing-inventory system with random order size policy and server vacations, Ann. Oper. Res.. doi:10.1007/s10479-020-03859-3 · Zbl 1485.90009 |
| [22] | Melikov, A. Z.; Shahmaliyev, M. O., Markov models of inventory management systems with a positive service time, J. Comput. & Syst. Sci. Int., 57, 5, 767-783 (2018) · Zbl 1411.90034 · doi:10.1134/S106423071805009X |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
