上海交通大学学报(自然版) ›› 2017, Vol. 51 ›› Issue (10): 1214-1219.doi: 10.16183/j.cnki.jsjtu.2017.10.010

• 兵器工业 • 上一篇    下一篇

 考虑机器人约束加工的制造单元调度方法

 周炳海,黎明   

  1.  同济大学 机械与能源工程学院, 上海 201804
  • 出版日期:2017-10-31 发布日期:2017-10-31
  • 基金资助:
     

 Scheduling Method of Manufacturing Cells with
 Robot Restricted Processing

 ZHOU Binghai,LI Ming   

  1.  School of Mechanical Engineering, Tongji University, Shanghai 201804, China
  • Online:2017-10-31 Published:2017-10-31
  • Supported by:
     

摘要:  为了有效解决机器人制造单元中考虑机器人约束加工(Robot Restricted Processing, RRP)的调度问题,提出了基于时间约束集的调度策略.通过内外驻留和基本周期等概念对RRP问题进行描述,以系统平均制造周期最小作为目标,建立综合考虑RRP、驻留及资源约束的调度数学模型.为最优化机器人作业顺序,提出了一种禁忌循环时间点(Tabu Circulatory Time Point, TCTP)搜索算法.并且进行了仿真实验分析,结果表明该算法是可行且有效的.

关键词:  , 机器人约束加工; 制造单元; 驻留约束; 时间约束集; 调度算法

Abstract:  To solve a scheduling problem of manufacturing cells with robot restricted processing (RRP), a scheduling strategy based on time constraints was proposed. Firstly, a nonfree robotic process was formally described by introducing novel concepts of internal and external residencies and fundamental period. A mathematical programming model considering characteristics of the nonfree robotic process, resources and residency constraints was established to minimize the average manufacturing cycle time. To optimize robotarm movements, a tabu circulatory time point searching algorithm was constructed.Finally, analysis of simulation experiments was implemented. Results indicate that the proposed algorithm is valid and feasible.

Key words:  robot restricted processing, manufacturing cells, residency constraint, time constraints, scheduling algorithm

中图分类号: