柔性制造系统刀具需求规划的启发式算法  

Heuristic Algorithm for Tool Requirements Planning in Flexible Manufacturing System

作　　者：王解法[1] 冯祖仁[1] 李世敬[1] 李渤[1] 

机构地区：[1]西安交通大学电子与信息工程学院

出　　处：《西安交通大学学报》2003年第12期1259-1262,1271,共5页Journal of Xi'an Jiaotong University

摘　　要：以一个刀具移动的柔性制造系统为背景,研究了刀具需求规划问题,即在刀具购买资金预算内如何规划任务所需刀具中每种规格的刀具数量使其在制时间最小.利用刀具控制策略对在制时间不灵敏的特点,采用递归算法求出了在制时间和刀具等待时间,然后通过增加关键机床上的关键刀具集合数量来修改中央刀具库中的初始刀具配置.不断重复以上2个步骤,直到超过刀具购买资金的约束.对随机产生的问题进行了数据计算,结果表明,所介绍的算法从整体性能上优于现有的算法.Based on a tool movement flexible manufacturing system (FMS), the tool requirements planning problem was investigated, which determines the number of each tool type for a limited tool budget with the objective of minimizing makespan. The makespan and the tool wait delay were calculated through a recursive algorithm based on the insensitive effect of the tool transfer time on the makespan. Then the number of tool copies for critical tool types in the center tool storage, which has the maximal ratio of the effective wait delay to their total purchase costs in the critical machine, was increased. The above two steps were repeated until the tool budget was reached. Experiments were conducted based on the random data. The numerical results show that the heuristic algorithm proposed here has the better overall performance than others.

关 键 词：柔性制造系统 刀具需求规划 在制时间 递归算法 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]