首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Asymptotically optimal production policies in dynamic stochastic jobshops with limited buffers
Authors:Yumei Hou  Suresh P Sethi  Hanqin Zhang
Institution:a Academy of Mathematics and System Sciences, Academia Sinica, Beijing, 100080, China
b Yanshan University, Hebei Province, China
c School of Management, The University of Texas at Dallas, Richardson, TX 75083-0688, USA
d Department of Mathematics, University of Georgia, Athens, GA 30602, USA
Abstract:We consider a production planning problem for a jobshop with unreliable machines producing a number of products. There are upper and lower bounds on intermediate parts and an upper bound on finished parts. The machine capacities are modelled as finite state Markov chains. The objective is to choose the rate of production so as to minimize the total discounted cost of inventory and production. Finding an optimal control policy for this problem is difficult. Instead, we derive an asymptotic approximation by letting the rates of change of the machine states approach infinity. The asymptotic analysis leads to a limiting problem in which the stochastic machine capacities are replaced by their equilibrium mean capacities. The value function for the original problem is shown to converge to the value function of the limiting problem. The convergence rate of the value function together with the error estimate for the constructed asymptotic optimal production policies are established.
Keywords:Optimal production policy  Stochastic manufacturing systems  Stochastic dynamic programming  Discounted cost  Asymptotic analysis
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号