论文部分内容阅读
目前,印刷电路板(PCB)组装业面临着多品种小批量的生产环境.提高生产效率,实现组装过程的最优化调度是PCB组装优化研究的核心问题,也是电子制造企业关注的重点.随着新的生产技术——整体切换台车的出现,吸嘴切换在多品种PCB组装中成为新的瓶颈.本文考虑吸嘴切换,对多品种PCB组装生产时间进行优化,建立了整数规划模型,并设计混合算法优化PCB组装的总完工时间.首先,采用遗传算法对多品种PCB进行分组;其次,对组内吸嘴分配问题采用改进的解决席位公平分配问题的增量算法,使得组内生产时间最短;最后,对组间吸嘴切换问题采用改进的KTNS(keep tool needed soonest)算法,使得切换次数最少,并通过实例分析证明了算法的有效性.
At present, printed circuit board (PCB) assembly industry is faced with a variety of small batch production environment.Improve the production efficiency, to achieve the optimal assembly process scheduling is the core issue of PCB assembly optimization research, but also the focus of electronic manufacturing enterprises.With the The new production technology - the emergence of the overall switching trolley and nozzle switching become the new bottleneck in multi-species PCB assembly.This paper considers the nozzle switching, optimizes the multi-species PCB assembly production time, establishes the integer programming model, and The hybrid algorithm is designed to optimize the total assembly time of the PCB assembly.Firstly, the genetic algorithm is used to group PCBs. Secondly, an incremental algorithm is proposed to solve the problem of nozzle distribution in the group, which makes the production time The shortest; Finally, the improved KTNS (keep tool for soonest) algorithm is applied to the inter-group nozzle switching problem, which results in the least number of handovers and the validity of the algorithm is proved through case studies.