Back to Search
Start Over
Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities
- Source :
- Mathematics, Volume 9, Issue 10, Mathematics, Vol 9, Iss 1092, p 1092 (2021)
- Publication Year :
- 2021
- Publisher :
- Multidisciplinary Digital Publishing Institute, 2021.
-
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.
- Subjects :
- 0209 industrial biotechnology
Operations research
Process (engineering)
Computer science
General Mathematics
0211 other engineering and technologies
02 engineering and technology
Point process
020901 industrial engineering & automation
Computer Science (miscellaneous)
QA1-939
matrix-analytic methods
Markovian arrival process
random opportunities
Engineering (miscellaneous)
batch demands
Service (business)
Queueing theory
021103 operations research
algorithmic probability
lead times
Zero (linguistics)
Moment (mathematics)
queuing-inventory systems
Algorithmic probability
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 22277390
- Database :
- OpenAIRE
- Journal :
- Mathematics
- Accession number :
- edsair.doi.dedup.....e085b93b63eaf84f89261ffd179ea790
- Full Text :
- https://doi.org/10.3390/math9101092