Next Article in Journal
Self-Management Portfolio System with Adaptive Association Mining: A Practical Application on Taiwan Stock Market
Previous Article in Journal
The Higher-Order of Adaptive Lasso and Elastic Net Methods for Classification on High Dimensional Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities

by
Srinivas R. Chakravarthy
1,* and
B. Madhu Rao
2
1
Departments of Industrial and Manufacturing Engineering & Mathematics, Kettering University, Flint, MI 48504, USA
2
Department of Business Systems and Analytics, School of Business Administration, Stetson University, Deland, FL 32723, USA
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(10), 1092; https://doi.org/10.3390/math9101092
Submission received: 18 April 2021 / Revised: 30 April 2021 / Accepted: 10 May 2021 / Published: 12 May 2021
(This article belongs to the Section E: Applied Mathematics)

Abstract

Combining the study of queuing with inventory is very common and such systems are referred to as queuing-inventory systems in the literature. These systems occur naturally in practice and have been studied extensively in the literature. The inventory systems considered in the literature generally include (s,S)-type. However, in this paper we look at opportunistic-type inventory replenishment in which there is an independent point process that is used to model events that are called opportunistic for replenishing inventory. When an opportunity (to replenish) occurs, a probabilistic rule that depends on the inventory level is used to determine whether to avail it or not. Assuming that the customers arrive according to a Markovian arrival process, the demands for inventory occur in batches of varying size, the demands require random service times that are modeled using a continuous-time phase-type distribution, and the point process for the opportunistic replenishment is a Poisson process, we apply matrix-analytic methods to study two of such models. In one of the models, the customers are lost when at arrivals there is no inventory and in the other model, the customers can enter into the system even if the inventory is zero but the server has to be busy at that moment. However, the customers are lost at arrivals when the server is idle with zero inventory or at service completion epochs that leave the inventory to be zero. Illustrative numerical examples are presented, and some possible future work is highlighted.
Keywords: queuing-inventory systems; algorithmic probability; batch demands; random opportunities; lead times; matrix-analytic methods queuing-inventory systems; algorithmic probability; batch demands; random opportunities; lead times; matrix-analytic methods

Share and Cite

MDPI and ACS Style

Chakravarthy, S.R.; Rao, B.M. Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities. Mathematics 2021, 9, 1092. https://doi.org/10.3390/math9101092

AMA Style

Chakravarthy SR, Rao BM. Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities. Mathematics. 2021; 9(10):1092. https://doi.org/10.3390/math9101092

Chicago/Turabian Style

Chakravarthy, Srinivas R., and B. Madhu Rao. 2021. "Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities" Mathematics 9, no. 10: 1092. https://doi.org/10.3390/math9101092

APA Style

Chakravarthy, S. R., & Rao, B. M. (2021). Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities. Mathematics, 9(10), 1092. https://doi.org/10.3390/math9101092

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop