A comparative analysis of (s, Q) and (s, S) ordering policies in a queueing-inventory system with stock-dependent arrival and queue-dependent service process
C. Sugapriya, Murugesan Nithya, K. Jeganathan, S. Selvakumar, T. Harikrishnan
{"title":"A comparative analysis of (s, Q) and (s, S) ordering policies in a queueing-inventory system with stock-dependent arrival and queue-dependent service process","authors":"C. Sugapriya, Murugesan Nithya, K. Jeganathan, S. Selvakumar, T. Harikrishnan","doi":"10.37190/ord230207","DOIUrl":null,"url":null,"abstract":"This article deals with a Markovian queuing-inventory system (MQIS) under the stochastic modeling technique. The arrival stream of this system is dependent on the present stock level at an instant. Meanwhile, the system focuses on reducing the waiting time of a unit by assuming a queue-dependent service policy (QDSP). The system consists of an infinite waiting hall to receive an arriving unit. The MQIS assumes that no unit of arrival is allowed when the stock level of the system is empty. The discussion of this MQIS runs over the two types of ordering principles named 1) (s, Q) 2) (s, S). According to both ordering principles, the assumed arrival and service patterns have been considered separately and classified as Model-I (M-I) and Model-II (M-II) respectively. The steady state of the system for both M-I and M-II is analysed and resolved under the Neuts matrix-geometric technique. The system performance measures of the system are also computed. The expected cost function of both M-I and M-II are constructed as well. Further, the necessary numerical illustrations are provided and distinguished for M-I and M-II to explore the proposed model. This paper finds the optimum ordering policy to execute the stock-dependent arrival and queue-dependent service strategies.","PeriodicalId":43244,"journal":{"name":"Operations Research and Decisions","volume":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research and Decisions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37190/ord230207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
This article deals with a Markovian queuing-inventory system (MQIS) under the stochastic modeling technique. The arrival stream of this system is dependent on the present stock level at an instant. Meanwhile, the system focuses on reducing the waiting time of a unit by assuming a queue-dependent service policy (QDSP). The system consists of an infinite waiting hall to receive an arriving unit. The MQIS assumes that no unit of arrival is allowed when the stock level of the system is empty. The discussion of this MQIS runs over the two types of ordering principles named 1) (s, Q) 2) (s, S). According to both ordering principles, the assumed arrival and service patterns have been considered separately and classified as Model-I (M-I) and Model-II (M-II) respectively. The steady state of the system for both M-I and M-II is analysed and resolved under the Neuts matrix-geometric technique. The system performance measures of the system are also computed. The expected cost function of both M-I and M-II are constructed as well. Further, the necessary numerical illustrations are provided and distinguished for M-I and M-II to explore the proposed model. This paper finds the optimum ordering policy to execute the stock-dependent arrival and queue-dependent service strategies.
本文研究了随机建模技术下的马尔可夫排队库存系统。该系统的到货流量取决于当前的库存水平。同时,该系统采用队列依赖服务策略(QDSP)来减少单元的等待时间。该系统由一个无限的等候大厅组成,以接收到达的单位。MQIS假定当系统的库存水平为空时不允许任何到达单位。关于MQIS的讨论涉及两种排序原则,即1)(s, Q) 2) (s, s)。根据这两种排序原则,假定的到达模式和服务模式被分别考虑,并被分类为模型- i (M-I)和模型- ii (M-II)。在Neuts矩阵-几何技术下,对M-I和M-II系统的稳态进行了分析和解析。对系统的性能指标进行了计算。同时构造了M-I和M-II的期望成本函数。此外,还为M-I和M-II提供了必要的数值例证,并对其进行了区分,以探索所提出的模型。本文寻找最优排序策略来执行依赖于库存的到达策略和依赖于队列的服务策略。