首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的BOM展开及低层码生成算法
引用本文:余锐林,吴顺祥.一种改进的BOM展开及低层码生成算法[J].计算机工程与应用,2005,41(27):100-102,115.
作者姓名:余锐林  吴顺祥
作者单位:厦门大学自动化系,厦门,361005;厦门大学自动化系,厦门,361005
基金项目:福建省教育委员会科技项目(编号:JA022239);厦门市重点科技项目(编号:3502E20031056)
摘    要:物料清单(BOM)和低层码(LLC)是MRP系统的关键输入,寻找一种高效的BOM遍历和低层码生成算法,是提高MRP计划编制效率的关键。传统的单层BOM存储格式描述的产品结构,通常采用递归算法进行BOM展开,但是递归算法的效率受到产品树层数的限制。论文基于SQLServer存储过程,通过创建一个临时堆栈表,使得BOM的遍历算法用一个循环就得以实现,实践证明,随着产品结构复杂度增加,该算法相对于递归算法更显示出其优越性。

关 键 词:主生产计划  MRP  物料清单  低层码  存储过程
文章编号:1002-8331-(2005)27-0100-03
收稿时间:2005-07
修稿时间:2005-07

A Kind of Improved Algorithm for the BOM Expandedness and LLC Calculation
Yu Ruilin,Wu Shunxiang.A Kind of Improved Algorithm for the BOM Expandedness and LLC Calculation[J].Computer Engineering and Applications,2005,41(27):100-102,115.
Authors:Yu Ruilin  Wu Shunxiang
Affiliation:Department of Automation,Xiamen University,Xiamen 361005
Abstract:Bill of Material(BOM) and Low-Level-Code(LLC) are important inputs of the MRP-system,to design an effective algorithm for the BOM expandedness and LLC calculation is a key thing to promote the efficiency of the MRP-system.The traditional product structure described by the form of single-level-bom may normally be expanded with recursive algorithm whose efficiency is restricted by the levels of the product-structure-tree.This paper presents,by using a temp stack table,an effective stored-procedure-based algorithm which is realized through a cycle,now it is proved that it is superior to the recursive algorithm,especially when the product structure is very complex.
Keywords:Master Production Schedule(MPS)  Material Requirement Planning(MRP)  Bill of Material(BOM)  Low Level Code(LLC)  stored procedure
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号