Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities

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 in...

Full description

Bibliographic Details
Main Authors: Srinivas R. Chakravarthy, B. Madhu Rao
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/9/10/1092
id doaj-e6079f8d230543e8915698bfb3028eb6
record_format Article
spelling doaj-e6079f8d230543e8915698bfb3028eb62021-05-31T23:50:34ZengMDPI AGMathematics2227-73902021-05-0191092109210.3390/math9101092Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment OpportunitiesSrinivas R. Chakravarthy0B. Madhu Rao1Departments of Industrial and Manufacturing Engineering & Mathematics, Kettering University, Flint, MI 48504, USADepartment of Business Systems and Analytics, School of Business Administration, Stetson University, Deland, FL 32723, USACombining 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mi>s</mi><mo>,</mo><mi>S</mi><mo>)</mo></mrow></semantics></math></inline-formula>-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.https://www.mdpi.com/2227-7390/9/10/1092queuing-inventory systemsalgorithmic probabilitybatch demandsrandom opportunitieslead timesmatrix-analytic methods
collection DOAJ
language English
format Article
sources DOAJ
author Srinivas R. Chakravarthy
B. Madhu Rao
spellingShingle Srinivas R. Chakravarthy
B. Madhu Rao
Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
Mathematics
queuing-inventory systems
algorithmic probability
batch demands
random opportunities
lead times
matrix-analytic methods
author_facet Srinivas R. Chakravarthy
B. Madhu Rao
author_sort Srinivas R. Chakravarthy
title Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
title_short Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
title_full Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
title_fullStr Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
title_full_unstemmed Queuing-Inventory Models with <i>MAP</i> Demands and Random Replenishment Opportunities
title_sort queuing-inventory models with <i>map</i> demands and random replenishment opportunities
publisher MDPI AG
series Mathematics
issn 2227-7390
publishDate 2021-05-01
description 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mi>s</mi><mo>,</mo><mi>S</mi><mo>)</mo></mrow></semantics></math></inline-formula>-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.
topic queuing-inventory systems
algorithmic probability
batch demands
random opportunities
lead times
matrix-analytic methods
url https://www.mdpi.com/2227-7390/9/10/1092
work_keys_str_mv AT srinivasrchakravarthy queuinginventorymodelswithimapidemandsandrandomreplenishmentopportunities
AT bmadhurao queuinginventorymodelswithimapidemandsandrandomreplenishmentopportunities
_version_ 1721416514298445824