Grouping PCBs with Minimum Feeder Changes |
| |
Authors: | Jouni Smed Kari Salonen Mika Johnsson Tommi Johtela Olli S Nevalainen |
| |
Institution: | 1. Turku Centre for Computer Science and Department of Information Technology, University of Turku, Fin-20014, Turku, Finland 2. Valor Computerized Systems (Finland), Ruukinkatu 2, Fin-20540, Turku, Finland
|
| |
Abstract: | In printed circuit board (PCB) assembly, the majority of electronic components are inserted by high-speed placement machines. Although the efficient utilization of the machinery is important for a manufacturer, it is hard to fully realize in high-mix low-volume production environments. On the machine level, the component setup strategy adopted by the manufacturer has a significant impact on the overall production efficiency. Usually, the setup strategy is formulated as a part type grouping problem or a minimum setup problem. In this article, we consider a hybridization of these two problems for the single machine case: The object function to be minimized includes a weighted sum of the number of part type groups (giving the number of setup occasions) and the number of feeder changeovers. We present algorithms for the problem and compare their efficiency. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|