期刊文献+

基于整数规划的PCB贴装时间优化算法

Approach to PCB Assembly Time Optimization Based on Integer Programming
下载PDF
导出
摘要 PCB组装时间取决于 2个因素 :包含元件的喂料器位置和元件的贴放顺序。综合考虑这 2个因素 ,提出基于整数规划的 PCB组装时间优化模型 ,并论证可转化为 TSP和 MWMP问题 ,从而利用已有算法求得模型的近似最优解。 The overall PCB assembly time depends on two different decision variables:the pickup locations of the components; the sequence in which the pickup and placement of components is performed In this paper,we develop a technique based on integer programming to determine optimal values of both the decision variables Since such a technique is computationally intractable,we also obtain near optimal solutions using the technique of TSP and MWMP for determining an optimum sequence of pickups and placements
作者 李兰 姜建国
出处 《现代电子技术》 2003年第12期79-81,共3页 Modern Electronics Technique
关键词 整数规划 PCB 贴装时间 TSP MWMP 优化算法 PCB assembly integer programming TSP MWMP optimization
  • 相关文献

参考文献3

  • 1Chan D.Mercier D,IC insertion:an application of the traveling salesman problem.Int.J.Productions Res.,1989,27(10):1837—1841.
  • 2Sadiq M,Landers T L,Taylor G D.A heuristic algorithm for minimizing total production time for fl sequence of jobs on a suferace mount placement machine.Int.J.Productions Res,1992,31:1327—1341.
  • 3Kumar R,Haomin Li.Assembly time optimization for pcb assembly,in Proc.1994 Amer.Control Conf.,1994:306-310.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部