Perishable Inventory System with N-Policy, MAP Arrivals, and Impatient Customers

In this study, we consider a perishable inventory system that has an (s, Q) ordering policy, along with a finite waiting hall. The single server, which provides an item to the customer after completing the required service performance for that item, only begins serving after N customers have arrived. Impatient demand is assumed in that the customers waiting to be served lose patience and leave the system if the server’s idle time overextends or if the arriving customers find the system to be full and will not enter the system. This article analyzes the impatient demands caused by the N-policy server to an inventory system. In the steadystate, we obtain the joint probability distribution of the level of inventory and the number of customers in the system. We analyze some measures of system performance and get the total expected cost rate in the steadystate. We present a beneficial cost function and confer the numerical illustration that describes the impact of impatient customers caused by N-policy on the inventory system’s total expected cost rate.

[1]  Oded Berman,et al.  DETERMINISTIC APPROXIMATIONS FOR INVENTORY MANAGEMENT AT SERVICE FACILITIES , 1993 .

[2]  Daniel P. Heyman,et al.  Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[3]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[4]  Lei Xu,et al.  Sustainable supply chain management for perishable products in emerging markets: An integrated location-inventory-routing model , 2021 .

[5]  M. Yadin,et al.  Queueing Systems with a Removable Service Station , 1963 .

[6]  Jau-Chuan Ke The control policy of an M[x]/G/1 queueing system with server startup and two vacation types , 2001, Math. Methods Oper. Res..

[7]  Steven Nahmias,et al.  Perishable Inventory Theory: A Review , 1982, Oper. Res..

[8]  Rotational (and Other) Representations of Stochastic Matrices , 2007 .

[9]  B. Sivakumar,et al.  Optimal control of service parameter for a perishable inventory system maintained at service facility with impatient customers , 2015, Ann. Oper. Res..

[10]  N. Anbazhagan,et al.  Perishable Inventory System with Server Interruptions, Multiple Server Vacations, and N Policy , 2015, Int. J. Oper. Res. Inf. Syst..

[11]  Sung-Seok Ko,et al.  An $(s,S)$ inventory model with level-dependent $G/M/1$-Type structure , 2015 .

[12]  Paul Manuel,et al.  A perishable inventory system with service facilities, MAP arrivals and PH — Service times , 2007 .

[13]  N. Anbazhagan,et al.  Perishable Inventory System at Service Facilities with N Policy , 2007 .

[14]  Soroush Avakh Darestani,et al.  Robust optimization of a bi-objective closed-loop supply chain network for perishable goods considering queue system , 2019, Comput. Ind. Eng..

[15]  K. H. Wang,et al.  (International Transactions in Operational Research,09(2):195-212)Control Policies of an M/G/1 Queueing System with a Removable and Non-reliable Server , 2002 .

[16]  S. Kalpakam,et al.  A continuous review perishable inventory model , 1988 .

[17]  Canrong Zhang,et al.  Machine learning-driven algorithms for the container relocation problem , 2020 .

[18]  Liming Liu,et al.  (s, S) Continuous Review Models for Products with Fixed Lifetimes , 1999, Oper. Res..

[19]  B. Sivakumar,et al.  A perishable inventory system with service facility and finite source , 2013 .

[20]  M. Amirthakodi,et al.  An inventory system with service facility and finite orbit size for feedback customers , 2015 .

[21]  Oualid Jouini,et al.  Control policies for single-stage production systems with perishable inventory and customer impatience , 2013, Ann. Oper. Res..

[22]  Howard J. Weiss,et al.  Optimal Ordering Policies for Continuous Review Perishable Inventory Models , 1980, Oper. Res..

[23]  Srinivas R. Chakravarthy,et al.  Analysis of a retrial queuing model with MAP arrivals and two types of customers , 2003 .

[24]  Offer Kella The threshold policy in the M/G/1 queue with server vacations , 1989 .

[25]  Jongwoo Jeon,et al.  A new approach to an N/G/1 queue , 2000, Queueing Syst. Theory Appl..