The stochastic lot-sizing problem with quantity discounts

详细信息    查看全文

• 作者：Wen Jiao ; ^a ; ^{wendy.j@connect.polyu.hk} ; Ju-Liang Zhang^b ; Hong Yan^a
• 关键词：Inventory ; Stochastic lot-sizing problem ; All-unit quantity discounts ; Polynomial time algorithm
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：1-10
• 全文大小：837 K
• 卷排序：80

文摘

This paper examines the uncapacitated stochastic lot-sizing problem with quantity discounts in finite horizon. By modeling the problem with a scenario tree, we characterize properties of the optimal policy and propose a polynomial time algorithm in terms of the number of nodes in the scenario tree. Numerical experiments are conducted to evaluate the performance of the algorithm and to gain the management insights.