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


Dynamic lot sizing problem with continuous-time Markovian production cost
Authors:Amir Azaron  Ou Tang  Reza Tavakkoli-Moghaddam
Institution:aMichael Smurfit Graduate School of Business, University College Dublin, Carysfort Avenue, Blackrock, Co. Dublin, Ireland;bDepartment of Management and Engineering, Linköping University, Linköping, Sweden;cDepartment of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;dSchool of Economics and Management, Tongji University, Shanghai, China
Abstract:This paper develops a polynomial algorithm for obtaining dynamic economic lot sizes in a single product multiperiod production system with the objective of minimizing total production and inventory costs over T periods. It is assumed that production costs are linear, inventory costs are concave, setup costs are zero and backlogging is not permitted in all periods. Moreover, the unit production cost is a stochastic variable, which is evolved according to a continuous-time Markov process over the planning horizon. The model is formulated as a stochastic dynamic programming (DP) optimization with the state variable being unit production cost. Then, it is solved using the backward dynamic programming approach. To justify the application of the proposed model, two practical cases are presented.
Keywords:Dynamic lot sizing  Dynamic programming  Stochastic processes
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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