Stochastic decomposition in production inventory with service time |
| |
Authors: | A. Krishnamoorthy Narayanan C. Viswanath |
| |
Affiliation: | 1. Dept. of Mathematics, Cochin University of Science & Technology, Kochi 682 022, India;2. Dept. of Mathematics, Govt. Engg. College, Thrissur 680 009, India |
| |
Abstract: | We study an (s, S) production inventory system where the processing of inventory requires a positive random amount of time. As a consequence a queue of demands is formed. Demand process is assumed to be Poisson, duration of each service and time required to add an item to the inventory when the production is on, are independent, non-identically distributed exponential random variables. We assume that no customer joins the queue when the inventory level is zero. This assumption leads to an explicit product form solution for the steady state probability vector, using a simple approach. This is despite the fact that there is a strong correlation between the lead-time (the time required to add an item into the inventory) and the number of customers waiting in the system. The technique is: combine the steady state vector of the classical M/M/1 queue and the steady state vector of a production inventory system where the service is instantaneous and no backlogs are allowed. Using a similar technique, the expected length of a production cycle is also obtained explicitly. The optimal values of S and the production switching on level s have been studied for a cost function involving the steady state system performance measures. Since we have obtained explicit expressions for the performance measures, analytic expressions have been derived for calculating the optimal values of S and s. |
| |
Keywords: | Inventory ( boldFont" >s, boldFont" >S) Production inventory system Positive service time Markov processes Decomposition |
本文献已被 ScienceDirect 等数据库收录! |
|