欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
从能力有限的动态批量问题出现开始，国内外众多学者全心致力于这类问题的研究。随着环境问题在制造业企业生产过程中的日益突出，资源回收与再制造成为了许多企业关注的热点。为了充分考虑实际生产的需要，本文在Richter再制造模型的基础上，引入库存能力约束，利用动态规划方法给出一个多项式算法来求解终产品库存能力受限问题和退回产品库存能力受限问题，并分别用一个模拟算例验证了算法的可行性。
英文摘要：
This paper addresses the dynamic lot sizing problem for systems with bounded inventory and remanufacturing. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied not only by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Only a few studies can be found in the literature for this situation, and among them remanufacturing is not usually. In this paper, we consider the lot sizing problem bounded inventory and remanufacturing. The objective is to determine those lot sizes for manufacturing and remanufacturing that minimize the total cost composed of holding cost for returns and （re） manufactured products and setup costs. The joint setup cost for manufacturing and remanufacturing i.e. a single production line is considered. Two different limited inventory capacity are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present an exact, polynomial time dynamic programming algorithm.
同期刊论文项目
同项目期刊论文
The evolvement and relevant factors of price discovery: A case study of cross-listed stocks in China
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling proble
位置：