Retrial Queuing-Inventory Systems with Delayed Feedback and Instantaneous Damaging of Items
This paper studies a Markov model of a queuing-inventory system with primary, retrial, and feedback customers. Primary customers form a Poisson flow, and if an inventory level is positive upon their arrival, they instantly receive the items. If the inventory level is equal to zero upon arrival of a...
Saved in:
Published in: | Axioms Vol. 11; no. 5; p. 241 |
---|---|
Main Authors: | , , , |
Format: | Journal Article |
Language: | English |
Published: |
Basel
MDPI AG
01-05-2022
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper studies a Markov model of a queuing-inventory system with primary, retrial, and feedback customers. Primary customers form a Poisson flow, and if an inventory level is positive upon their arrival, they instantly receive the items. If the inventory level is equal to zero upon arrival of a primary customer, then this customer, according to the Bernoulli scheme, either leaves the system or goes into an infinite buffer to repeat their request in the future. The rate of retrial customers is constant, and if the inventory level is zero upon arrival of a retrial customer, then this customer, according to the Bernoulli scheme, either leaves orbit or remains in orbit to repeat its request in the future. According to the Bernoulli scheme, each served primary or retrial customer either leaves the system or feedbacks into orbit to repeat their request. Destructive customers that form a Poisson flow cause damage to items. Unlike primary, retrial, and feedback customers, destructive customers do not require items, since, upon arrival of such customers, the inventory level instantly decreases by one. The system adopted one of two replenishment policies: (s, Q) or (s, S). In both policies, the lead time is a random variable that has an exponential distribution. It is shown that the mathematical model of the system under study was a two-dimensional Markov chain with an infinite state space. Algorithms for calculating the elements of the generating matrices of the constructed chains were developed, and the ergodicity conditions for both policies were found. To calculate the steady-state probabilities, a matrix-geometric method was used. Formulas were found for calculating the main performance measures of the system. The results of the numerical experiments, including the minimization of the total cost, are demonstrated. |
---|---|
ISSN: | 2075-1680 2075-1680 |
DOI: | 10.3390/axioms11050241 |