ANALYSIS OF M, MAP/PH/2 NON- PREEMPTIVE PRIORITY QUEUEING INVENTORY SYSTEM WITH BREAKDOWN, REPAIR AND (s, S) POLICY.

Saved in:
Bibliographic Details
Title: ANALYSIS OF M, MAP/PH/2 NON- PREEMPTIVE PRIORITY QUEUEING INVENTORY SYSTEM WITH BREAKDOWN, REPAIR AND (s, S) POLICY.
Authors: AYYAPPAN, G.1 ayyappan@ptuniv.edu.in, THILAKAVATHY, M.1 mthilakavathy89@gmail.com
Source: Reliability: Theory & Applications. Sep2025, Vol. 20 Issue 3, p934-948. 15p.
Subjects: Queuing theory, Matrix analytic methods, Distribution (Probability theory), Inventory control, Inventory management systems, Computer performance
Abstract: We analyze a non-preemptive priority queueing model in this research that has two heterogeneous servers, each of which has its own queue. Queue 1 possesses a low priority status with infinite capacity and queue 2 possesses a high priority status with finite capacity. We made the assumption that arrival follows M, MAP and service time follows Phase-type distribution. Server 1 is always available in the system; Server 2 is an unreliable server. With a (s, S) policy, the inventory is filled up and an exponential distribution is scheduled for the replenishment time. Using the matrix analytical approach, a stationary probability vector was assessed, and a stability criterion was created for our system. Performance metrics are also studied using this technique. Both two and three-dimensional displays are used to show the numerical examples. [ABSTRACT FROM AUTHOR]
Copyright of Reliability: Theory & Applications is the property of International Group on Reliability and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We analyze a non-preemptive priority queueing model in this research that has two heterogeneous servers, each of which has its own queue. Queue 1 possesses a low priority status with infinite capacity and queue 2 possesses a high priority status with finite capacity. We made the assumption that arrival follows M, MAP and service time follows Phase-type distribution. Server 1 is always available in the system; Server 2 is an unreliable server. With a (s, S) policy, the inventory is filled up and an exponential distribution is scheduled for the replenishment time. Using the matrix analytical approach, a stationary probability vector was assessed, and a stability criterion was created for our system. Performance metrics are also studied using this technique. Both two and three-dimensional displays are used to show the numerical examples. [ABSTRACT FROM AUTHOR]
ISSN:19322321