Discrete MDP problem in service facility systems with inventory management Online publication date: Thu, 22-Aug-2019
by C. Selvakumar; P. Maheswari; C. Elango
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 5, No. 4, 2019
Abstract: In this article, we consider a discrete time (equally spaced) service facility system in which arrival of customers to the system is controlled by taking decision at the beginning of each period. Customers arrive for service are placed in a specified queue called potential queue. Controller observes the number of customers in the system (eligible queue + server), the number of items in inventory and decides the quantity of customers to be admitted from the potential queue, others are rejected. Demands arrive throughout the period, but they are satisfied (service completion) only at the end of the period. Inventory is maintained in the server to satisfy the customers at the service completion time. Inventory is replenished instantaneously when the level become zero. The system is formulated as a Markov decision process. A stationary cost structure is imposed at each decision epoch and optimal policy is obtained by using policy iteration algorithm. A numerical example is provided to illustrate the problem.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook