.png){kind=icon}
返回
Single item lot sizing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.01.054.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A state-of-the-art of a particular planning problem, the Single Item Lot Sizing Problem (SILSP), is given for its uncapacitated and capacitated versions. First classes of lot sizing problems are briefly surveyed. Various solution methods for the Uncapacitated Single Item Lot Sizing Problem (USILSP) are reviewed. Four different mathematical programming formulations of the classical problem are presented. Different extensions for real-world applications of this problem are discussed. Complexity results of the Capacitated Single Item Lot Sizing Problem (CSILSP) are given together with its different formulations and solution techniques. (c) 2004 Published by Elsevier B.V.
Keyword:
production
planning
lot-sizing
single item
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Is portion size selection associated with expected satiation, perceived healthfulness or expected tastiness? A case study on pizza using a photograph-based computer task.png)
Appetite
OAAI
AppetiteIF0
OAAI分享收藏
查看更多内容