An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows

被引：0
|
作者：
Hark-Chin Hwang
机构：
[1] Chosun University,Department of Industrial Engineering
来源：
Journal of Global Optimization | 2007年 / 37卷
关键词：
Dynamic lot-sizing model; Demand time window; Non-speculative cost structure; Dynamic programming; Production;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T3) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T2, nT}) time complexity.
引用
收藏
页码：11 / 26
页数：15
相关论文
共 50 条
12345