.png){kind=icon}
返回
A network flow model for the capacitated lot-sizing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0483(98)00045-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The lot-sizing problem considered in this paper consists in planning the production of multiple items on a single machine over a finite planning horizon divided into time periods. The objective of the problem is to determine a minimum cost production plan that meets the forecast demand for the items. The mathematical model considers setup time and setup cost, and is represented as a minimum cost network how problem. A branch-and-bound method is proposed for solving the model.:The performance of the method is evaluated by using numerical experiments for various demand patterns and values of cost parameters. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
production planning
lot-sizing
network flows
branch-and-bound
setup time
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
暂无机构信息
引用论文
分享收藏Fabrication conditions for efficient organic photovoltaic cells from aqueous dispersions of nanoparticles纳米颗粒水分散体制备高效有机光伏电池的条件.png)
RSC Adv.
OAAI
RSC Adv.IF0
OAAI分享收藏
查看更多内容