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


On stochastic lot-sizing problems with random lead times
Authors:Kai Huang  Si?mge Küçükyavuz
Institution:a Sub Department of Operations, Planning, Accounting and Control, Department of Technology Management, Technology University of Eindhoven, P.O. Box 513, 5600MB, Eindhoven, The Netherlands
b Department of Systems and Industrial Engineering, University of Arizona, P.O. Box 210020, Tucson, AZ 85721-0020, USA
Abstract:We give multi-stage stochastic programming formulations for lot-sizing problems where costs, demands and order lead times follow a general discrete-time stochastic process with finite support. We characterize the properties of an optimal solution and give a dynamic programming algorithm, polynomial in the scenario tree size, when orders do not cross in time.
Keywords:Stochastic programming  Lot-sizing  Semi-Wagner-Whitin property  Polynomial algorithm  Random lead times
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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