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


Dynamic lot-sizing model with demand time windows and speculative cost structure
Authors:Hark-Chin Hwang  Wikrom Jaruphongsa
Institution:a Department of Industrial Engineering, Chosun University, 375 Seosuk-Dong, Dong-Gu, Gwangju 501-759, South Korea
b Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore
Abstract:We consider a deterministic lot-sizing problem with demand time windows, where speculative motive is allowed. Utilizing an untraditional decomposition principle, we provide an optimal algorithm that runs in O(nT3) time, where n is the number of demands and T is the length of the planning horizon.
Keywords:Dynamic lot-sizing model  Demand time window  Speculative motive  Dynamic programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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