A study of inserting sequence and feeder allocation problem on printed circuit board

In this paper, the authors try to raise the efficiency of PCB production by improving the automated inserting process. The process is composed of a part inserting sequence and a feeder allocation problem. Until now, this problem is formulated as a Traveling Salesman Problem (TSP) or Rural Postman Problem. These concentrate more on inserting parts (chips). But in this paper, the authors concentrate on the Feeder. They formulate 0-1 Integer program (MP2) which is easier than TSP. This program can be solved by using LP Package (i.e. LINDO, GAMS etc). The authors propose a Heuristic algorithm ISFA which guarantees a local optimum and often gives optimal solutions. They give some examples to demonstrate ISFA algorithm. [In Korean.]