.png){kind=icon}
返回
Stochastic lot sizing problem with controllable processing times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2014.11.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost function is a convex function as it may reflect increasing marginal costs of larger reductions and may be more appropriate when the resource life, energy consumption or carbon emission are taken into consideration. We consider this problem under static uncertainty strategy and a service level constraints. We first introduce a nonlinear mixed integer programming formulation of the problem, and use the recent advances in second order cone programming to strengthen it and then solve by a commercial solver. Our computational experiments show that taking the processing times as constant may lead to more costly production plans, and the value of controllable processing times becomes more evident for a stochastic environment with a limited capacity. Moreover, we observe that controllable processing times increase the solution flexibility and provide a better solution in most of the problem instances, although the largest improvements are obtained when setup costs are high and the system has medium sized capacities. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Stochastic lot sizing
Controllable processing times
Second order cone programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏The stochastic dynamic production/inventory lot-sizing problem with service-level constraints具有服务水平约束的随机动态生产/库存批量问题
PREAI
分享收藏
查看更多内容