This paper deals with a two server (s,S) inventory system with positive service time, positive lead time, retrial of customers and negative arrivals. In this system, arrival of customers form a Poisson process, lead time and service time are exponentially distributed. The system starts with S units of inventory on hand. Each arriving customer is served a single unit of the item by any one of the servers. When the inventory level reaches s, an order is placed for (S-s) units. If the inventory level is zero or both servers are busy, then the arriving customer goes to orbit and becomes a source of repeated calls. Assume that the capacity of the orbit is infinite. The negative arrival plays an important role in this paper and it controls the congestion in the orbit by removing one customer from the orbit and further it is assumed that it removes the customer from the orbit only if inventory level is zero or both servers are busy. It is also assumed that the access from orbit to the service facility is governed by the classical retrial policy. This model is solved by using Direct Truncation Method. Numerical and graphical studies have been done for analysis of mean number of customers in the orbit, average inventory level, Truncation level, mean number of busy servers and system performance measures. A suitable cost function is defined.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.