| 一种改进的BOM存储和分解算法 |
| |
| 引用本文： | 汤岩,武利丰,纪贤标.一种改进的BOM存储和分解算法[J].集美大学学报(自然科学版),2007,12(2):166-169. |
| |
| 作者姓名： | 汤岩 武利丰 纪贤标 |
| |
| 作者单位： | 集美大学工商管理学院,福建,厦门,361021 |
| |
| 摘 要： | 存储ERP/MRP系统中的BOM,指针码的存储效率比层次码高得多,但在进行BOM分解计算时仍需要把指针码转换为层次码的形式,为此,本文对该算法进行了改进,即可以不经过指针码向层次码的转化,直接得到BOM的分解结果,大大简化了操作.
|
| 关 键 词： | MRP指针码 层次码 BOM分解算法 改进 存储 分解算法 Storage 操作 简化 结果 的转化 转换 分解计算 层次码 效率比 指针码 系统 |
| 文章编号： | 1007-7405（2007）02-0166-04 |
| 修稿时间： | 2005-11-09 |
An Improved Algorithm of Storage and Decomposing of BOM |
| |
| TANG Yan,WU Li-feng,JI Xian-biao.An Improved Algorithm of Storage and Decomposing of BOM[J].the Editorial Board of Jimei University(Natural Science),2007,12(2):166-169. |
| |
| Authors: | TANG Yan WU Li-feng JI Xian-biao |
| |
| Institution: | School of Business Administration, Jimei University, Xiamen 361021, China |
| |
| Abstract: | Pointer code has much higher efficiency than level code. However, when BOM is decomposed, pointer code must be transfered to level code. The algorithm is improved in this paper, which can directly get the decomposed result of BOM without converting pointer code to level code, and hence greatly simplifies the operation. |
| |
| Keywords: | Material Requirement Planning pointer code level code BOM decomposed algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
