拆解调度

Scheduling disassembly

International Journal of Production Research · 1994
被引 224 · 同刊同年前 1%
ABS 3

中文导读

针对具有明确产品结构的离散件产品,提出一种拆解调度算法,与MRP相反,需求来自组件层,算法更复杂,并给出电子表格实现示例。

Abstract

We present an algorithm for scheduling the disassembly of discrete parts products characterized by a well defined product structure. As opposed to MRP where the demand occurs at the end item level, the demand in the disassembly case is motivated by the component level of the product structure. Even though the objective in the disassembly case is the reverse of that of MRP, the algorithm itself is not the reverse of the MRP algorithm. It is considerably more complicated. An example is presented and its implementation in a spreadsheet is described.

生产调度拆解物料需求计划产品结构