• CN:11-2187/TH
  • ISSN:0577-6686

›› 2006, Vol. 42 ›› Issue (3): 22-29.

• 论文 • 上一篇    下一篇

基于图论的可重构制造系统重构策略

楼洪梁;杨将新;林亚福;胡建坤;吴昭同;盛伯浩   

  1. 浙江大学现代制造工程研究所;北京机床研究所
  • 发布日期:2006-03-15

RECONFIGURATING POLICY OF RECONFIGURABLE MANUFACTURING SYSTEMS BASED ON GRAPH THEORY

LOU Hongliang;YANG Jiangxin;LIN Yafu;HU Jiankun;WU Zhaotong;SHENG Bohao   

  1. Institute of Contemporary Manufacture Engine-ering, Zhejiang University Beijing Machine Tool Research Institute
  • Published:2006-03-15

摘要: 可重构制造系统(RMS)是针对零件族设计的既具有定制的柔性,又具有高生产率的制造系统。RMS通过重构来适应市场需求的变化。RMS的设计目标是基于重构条件下寻求制造系统在全生产周期内的系统成本最优。首先建立RMS的各生产周期成本模型、重构成本模型与全生产周期成本模型,构建RMS在各生产周期的组态有向图,利用Dijkstra算法与双向扫视算法求得RMS在各生产周期的最优成本组态与K–1个次优成本组态。根据所求得各生产周期的最优成本组态与K–1个次优成本组态,重构成本模型与全生产周期成本模型,计算上下生产周期各组态间的重构成本,并构建RMS全生产周期的重构策略有向图,再次利用Dijkstra算法与双向扫视算法求得RMS全生产周期的最优重构策略与K–1个次优重构策略。最后用实例验证了方法的有效性与可行性。

关键词: Dijkstra算法, 可重构制造系统, 双向扫视算法, 图论, 重构策略, 重构成本

Abstract: Reconfigurable manufacturing systems (RMS) are manufacturing systems designed for part family, which have both customized flexibility and high productivity. RMS adapt to the fast market fluctuation by reconfigurating. The design objective of RMS is to find the optimal and sub-optimal cost configuration paths across the lifetime of manufacturing systems. First, the cost model for every production period of RMS, the reconfigurating cost model and the lifetime cost model of RMS are constructed. Second, the directed graphs of configurations of RMS at every production period are constructed. Finally, based on the directed graphs, the optimal and K–1 sub-optimal cost configurations of RMS at every production period are found out by using Dijkstra algorithm and double-sweep algori- thm. According to the optimal and K–1 sub-optimal cost configurations of RMS at every production period, the reconfi- gurating cost model and the lifetime cost model of RMS achieved above, the reconfigurating costs between every configuration at the up-production period and every one at the down-production period are calculated, then the econfigurating policy directed graph across the lifetime of RMS is constructed. Using the Dij-kstra algorithm and double-sweep algorithm again, the optimal and K–1 sub-optimal reconfigurating policy across the lifetime of RMS is figured out. Finally, a case study illustrates the deve-loped method is valid.

Key words: Dijkstra algorithm Double-sweep algorithm, Reconfigurable manufacturing systems Reconfigurating policy, Reconfigurating cost Graph theory

中图分类号: