밀집구역분리와 슬롯이중배정에 의한 효율적 PCB 조립 방법의 연구 = A study on the method of efficient PCB assembly by separation of crowed area and double allocation of slot

다국어 초록 (Multilingual Abstract)

Determination of component mounting sequence on printed circuit board assembly process is a typical NP-hard problem. It is a kind of traveling salesman problems, but it has one more hard to meet constraint of matching component type per mounting position as well as searching the shortest path. An efficient method is developed by separation of crowed area and allowing up to two slots per component type. A simulation model is constructed using Visual C++ for evaluation of the suggested heuristic.

참고문헌 (Reference)

1 "optimization of printed circuit board manufacturing:Integrated modeling and algorithms" 124 (124): 409-421,

2 "The feeder rack assignment problem in PCB assembly A Case study" 64 : 399-407, 2000

3 "The assembly of printed circuit boards A case with multiple machines and multiple board typeds" 98 : 457-472, 1997

4 "Production planning problems in printed circuit board assmbly" 123 : 339-361, 2002

5 "PCB의 효율적인 조립방법에 관한연구" 2003

6 "PCAAD - an object-oriented expert system for assembly of printed circuit boards" 9 : -1, 1992

7 "Optimization of the movements of a component placement machine" -38, 1989

8 "Heuristic methods for flexible line scheduling" 6 : -4, 1987

9 "Engineering a circuit board assembly line for a desired capacity and flowtime" 10 (10): 492- 500, 1991

10 "Efficient operation of a surface mounting machine with a multihead turret" 25 : 1131- 1143, 1996

11 "An optimal assembly mode of multi-type printed circuit boards" 36 : 451-471, 1999

12 "An adaptable scheduling algorithm for flexible flow lines" 36 : -3, 1988

13 "A just-in-time simulation model of a PCB assembly line" 20 : -1, 1991

14 "A heuristic algorithm for loading new work on circuit pack assembly lines" 28 : -10, 1990