返回
A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
DOI:10.1016/j.cor.2021.105302.png)
摘要
En 中文
In this study, we address the capacitated stochastic lot-sizing problem under alpha service level constraints. We assume that processing times can be decreased in return for compression cost that follows a convex function. We consider this problem under the static uncertainty strategy suggesting to determine replenishment plans at the beginning of the planning horizon. We develop an extended mixed integer programming (MIP) formulation built on a predefined piecewise linear approximation. Then, we adopt the so-called dynamic cut generation approach to be able to use the proposed MIP formulation with no prior approximation of the cost function. Also, we demonstrate how to extend the dynamic cut generation approach to consider the exact inventory cost in the objective function. We show the computational performance of the proposed MIP model with the dynamic cut generation approach in an extensive numerical study where second order cone programming formulations developed in the literature are used as benchmark. The results reveal that the proposed MIP model deployed with the dynamic cut generation yields a superior computational performance as compared to the benchmark formulations especially when the order of compression cost function is higher.
Keyword:
Inventory
Stochastic lot-sizing
Controllable processing time
Mixed integer programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales具有退货和销售损失的多级批量问题的多阶段随机整数规划方法
Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints服务水平约束下具有再制造的随机经济批量问题的启发式策略

