摘要
提出了一种基于整数规划和排序聚类算法的敏捷制造单元动态重构算法 ,该算法分为两步 ,首先根据加工任务、工艺规程和允许的制造资源集合 ,通过整数规划算法 ,确定由哪些制造资源以何种工艺规程完成加工任务 ,然后 ,根据制造资源承担加工任务的工艺相似性 ,通过排序聚类算法 ,将制造资源聚合成不同的敏捷制造单元。最后 ,对该算法的性能和特点进行了分析 。
Dynamic reconfiguration of agile manufacturing cell(AMC) involves selecting and organizing appropiate manufacturing resources into AMCs, which is the key enabling technology of AMC. Based on the theories of integer programming and cluster analysis, a reconfiguration algorithm that involves rapidly reorganizing feasible manufacturing resources into disserent AMCs according to different production tasks is proposed in the paper. Its goal is to accomplish assgned production task with the lowest cost in an assigned time horizon, and finally to generate the configurations of AMCs.
关键词
敏捷制造单元
动态重构
整数规划
聚类分析
agile manufacturing cell
dynamic reconfiguration
integer programming
cluster analysis
