<p>We investigate an <i>M</i>/<i>G</i>/1 queueing-inventory (<i>QI</i>) system where service operations consume inventory units, arrivals follow a Poisson process with replenishment which are both random in size and subject to exponentially distributed lead times. Unlike the conventional <i>QI</i> models, customer demands are not assumed to be a fixed quantity. Instead, they are modeled using a geometric batch-size distribution, which accounts for the variability in the number of units or services requested by each customer. Customers may deplete multiple inventory units per service, and replenishment is triggered once inventory falls to or below a predefined reorder level <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(r~(&gt;0)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mspace width="3.33333pt" /> <mo stretchy="false">(</mo> <mo>&gt;</mo> <mn>0</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. When inventory level becomes <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\le r\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>≤</mo> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation> after serving the random customer demand an variable ordering quantity <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(o_j~(1\le j \le Q=M-r)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>o</mi> <mi>j</mi> </msub> <mspace width="3.33333pt" /> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>≤</mo> <mi>j</mi> <mo>≤</mo> <mi>Q</mi> <mo>=</mo> <mi>M</mi> <mo>-</mo> <mi>r</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, where <i>M</i> is the maximum inventory level the server may hold at time. To analyze the system, we construct an embedded Markov chain at post-departure epochs and apply the roots’ method to obtain the joint stationary distribution of number of customers in the systems and the corresponding inventory levels. Explicit vector-generating functions are obtained from which joint stationary probabilities, random epoch probabilities, and performance measures are calculated. A reward-based optimization model is incorporated to study the effect of pricing and demand sensitivity on the expected profit. Numerical results under light and heavy-tailed service-time distributions validate the approach and highlight the influence of service-time variability and replenishment uncertainty on profitability. The study extends existing classical <i>QI</i> models and provides insights for supply chain, retail, and service operations where inventory-dependent service is essential.</p>

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

Computational Procedures and Optimal Pricing Strategies for Stochastic Queueing-Inventory Systems with Random-Replenishment Order Size and Batch-size Demand

  • Ranu Singh,
  • Abhijit Datta Banik

摘要

We investigate an M/G/1 queueing-inventory (QI) system where service operations consume inventory units, arrivals follow a Poisson process with replenishment which are both random in size and subject to exponentially distributed lead times. Unlike the conventional QI models, customer demands are not assumed to be a fixed quantity. Instead, they are modeled using a geometric batch-size distribution, which accounts for the variability in the number of units or services requested by each customer. Customers may deplete multiple inventory units per service, and replenishment is triggered once inventory falls to or below a predefined reorder level \(r~(>0)\) r ( > 0 ) . When inventory level becomes \(\le r\) r after serving the random customer demand an variable ordering quantity \(o_j~(1\le j \le Q=M-r)\) o j ( 1 j Q = M - r ) , where M is the maximum inventory level the server may hold at time. To analyze the system, we construct an embedded Markov chain at post-departure epochs and apply the roots’ method to obtain the joint stationary distribution of number of customers in the systems and the corresponding inventory levels. Explicit vector-generating functions are obtained from which joint stationary probabilities, random epoch probabilities, and performance measures are calculated. A reward-based optimization model is incorporated to study the effect of pricing and demand sensitivity on the expected profit. Numerical results under light and heavy-tailed service-time distributions validate the approach and highlight the influence of service-time variability and replenishment uncertainty on profitability. The study extends existing classical QI models and provides insights for supply chain, retail, and service operations where inventory-dependent service is essential.