<p>This paper presents a comprehensive analysis of four single-server queueing inventory models (QI models ) in which customers can demand single or bulk units of a commodity. Inventory is managed using the (<i>s</i>,&#xa0;<i>S</i>) replenishment policy with exponentially distributed lead time, while customer arrivals follow Poisson process and service times are exponentially distributed. Each customer may demand up to <i>a</i> units, where <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13171_2025_398_Article_IEq1.gif" Format="GIF" Height="11" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(a &lt; s\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>&lt;</mo> <mi>s</mi> </mrow> </math></EquationSource> </InlineEquation>. Model 1 deals with a QI system with multiple queues: queues are formed based on the demand size of the customers, so that the <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13171_2025_398_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\( i^{th}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>i</mi> <mrow> <mi mathvariant="italic">th</mi> </mrow> </msup> </math></EquationSource> </InlineEquation> queue contains customers who demand <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13171_2025_398_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="10" /> </InlineMediaObject> <EquationSource Format="TEX">\( i\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>i</mi> </math></EquationSource> </InlineEquation> number of units (<InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13171_2025_398_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="104" /> </InlineMediaObject> <EquationSource Format="TEX">\(i = 1,2,\dots ,a.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <mi>a</mi> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation>). Priority is given to customers with smaller demands. Model 2 is a restriction of Model 1, in which all customers are blocked during stockout. Model 3 considers a single-queue single-server queueing inventory system in which demand quantities are revealed only when customers are taken for service; all categories of customers are to be in the same queue. Model 4 is a modified version of Model 3 - blocking all customers when inventory level drops to zero. By formulating these models as quasi-birth-and-death (QBD) processes and applying the matrix-geometric solution method, we derive stability conditions, stationary distribution of the process and various system performance measures. In addition, we investigate server idle times and the durations of inventory cycles. Through several numerical experiments, we illustrate how variations in the system parameters affect the performance characteristics, providing insights into the operational dynamics of each model.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Queueing Inventory Systems with Single and Bulk Demand Quantities

  • Shajeeb P U,
  • Jaison Jacob,
  • Achyutha Krishnamoorthy

摘要

This paper presents a comprehensive analysis of four single-server queueing inventory models (QI models ) in which customers can demand single or bulk units of a commodity. Inventory is managed using the (sS) replenishment policy with exponentially distributed lead time, while customer arrivals follow Poisson process and service times are exponentially distributed. Each customer may demand up to a units, where \(a < s\) a < s . Model 1 deals with a QI system with multiple queues: queues are formed based on the demand size of the customers, so that the \( i^{th}\) i th queue contains customers who demand \( i\) i number of units ( \(i = 1,2,\dots ,a.\) i = 1 , 2 , , a . ). Priority is given to customers with smaller demands. Model 2 is a restriction of Model 1, in which all customers are blocked during stockout. Model 3 considers a single-queue single-server queueing inventory system in which demand quantities are revealed only when customers are taken for service; all categories of customers are to be in the same queue. Model 4 is a modified version of Model 3 - blocking all customers when inventory level drops to zero. By formulating these models as quasi-birth-and-death (QBD) processes and applying the matrix-geometric solution method, we derive stability conditions, stationary distribution of the process and various system performance measures. In addition, we investigate server idle times and the durations of inventory cycles. Through several numerical experiments, we illustrate how variations in the system parameters affect the performance characteristics, providing insights into the operational dynamics of each model.