首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A heuristic approach for component scheduling on a high-speed PCB assembly machine
Authors:W Ho  P Ji  Y Wu
Institution:1. Operations and Information Management Group , Aston Business School, Aston University , Birmingham B4 7ET, UK w.ho@aston.ac.uk;3. Department of Industrial and Systems Engineering , The Hong Kong Polytechnic University , Hung Hom, Kowloon, Hong Kong
Abstract:The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.
Keywords:Printed circuit board assembly  Collect-and-place machines  Component scheduling  Hybrid genetic algorithm
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号