.png){kind=icon}
返回
A memetic algorithm for a multistage capacitated lot-sizing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0925-5273(03)00093-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a heuristic approach to solve a complex problem in production planning, the multistage lot-sizing problem with capacity constraints. It consists of determining the quantity to be produced in different periods in a planning horizon, such that an initially given demand forecast can be attained. We consider setup costs and setup times. Due the complexity to solve this problem, we developed methods based on evolutionary metaheuristics, more specifically a memetic algorithm. The proposed heuristics are evaluated using randomly generated instances and well-known examples in the literature. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
production planning
material requirements planning
lot-sizing
metaheuristics
memetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏Fabrication conditions for efficient organic photovoltaic cells from aqueous dispersions of nanoparticles纳米颗粒水分散体制备高效有机光伏电池的条件.png)
RSC Adv.
OAAI
RSC Adv.IF0
OAAI分享收藏分享收藏
查看更多内容