Title: Discrete MDP problem in service facility systems with inventory management

Authors: C. Selvakumar; P. Maheswari; C. Elango

Addresses: Research Department of Mathematical Sciences, Cardamom Planters' Association College, Bodinayakanur 625-513, Tamil Nadu, India ' Research Department of Mathematical Sciences, Cardamom Planters' Association College, Bodinayakanur 625-513, Tamil Nadu, India ' Research Department of Mathematical Sciences, Cardamom Planters' Association College, Bodinayakanur 625-513, Tamil Nadu, India

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.

Keywords: discrete-time MDP; admission control; service facility with inventory; Markov decision process; MDP.

DOI: 10.1504/IJCSYSE.2019.101705

International Journal of Computational Systems Engineering, 2019 Vol.5 No.4, pp.243 - 250

Received: 18 Nov 2017
Accepted: 16 May 2018
Published online: 22 Aug 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article