On a Priority Queueing Inventory System with Varying Demand  Quantities

Shajeeb P U,, Jaison Jacob, Abdul Rof V

On a Priority Queueing Inventory System with Varying Demand Quantities

Authors

Shajeeb P U,, Jaison Jacob, Abdul Rof V

Keywords:

Queueing inventory system, Type 1 and Type 2 customers, Continuous Time Markov Chain, Non-preemptive priority, Matrix Geometric Method

Abstract

A single server, two - priority queueing inventory (inventory with positive service time ) is considered
under the replenishment policy (s, S). Priority 1 customers (Type 1) have unlimited waiting space; they arrive

References

Neuts M.F.(1994). Matrix-Geometric Solutions in Stochastic Models - An Agorithmic Approach. Dover Publication Inc., New York, 2nd ed.

Krishnamoorthy, A., Joshua, A. N., and Kozyrev, D. (2021). Analysis of a batch arrival, batch service queuing-inventory system with processing of inventory while on vacation. Mathematics, 9(4):419. Available online: https://www.mdpi.com/22277390/9/4/419

Downloads

Published

2021-06-15

How to Cite

Shajeeb P U, Jaison Jacob, Abdul Rof V. (2021). On a Priority Queueing Inventory System with Varying Demand Quantities . Journal of Computational Analysis and Applications (JoCAAA), 29(6), 1297–1311. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/3250