.png){kind=icon}
返回
Energy-aware lot sizing problem: Complexity analysis and exact algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijpe.2018.06.020.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O ((MT4)-T-5) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O ((MT6)-T-6).
Keyword:
Lot sizing problem
Energy
Capacitated parallel machines
Polynomial time algorithm
Complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
Systematic literature review of decision support models for energy efficient production planning
.png){kind=icon}
PREAI
分享收藏分享收藏
查看更多内容