| Summary: | 碩士 === 元智大學 === 工業工程研究所 === 83 === In the electric industry , the insertions of Printed
Circuit Board forassemble operation in electrical parts are not
only the most important connections , but also it needs the
highest density of manpower , Recently , owing to the
progress of automatic insertion equipments , makes the
insertion technique of PCB more mature。 In the automatic
insertion techniques of the past , one one may need different
solution approaches for solving the sequential problems of
electrical parts on PCB。Due to the fast development of IC
industries,each PCB may needs a lot of electrical parts and
this makes the sequencing problem of the PCB even more
difficults and time consuming Therefore , the development
of a quick and fast solution algorithm for the PCB insertion
problem is thus desperately need。 Our research focuses on
applying branch and bound method on the automatic insertion of
PCB ,and develop a heuristic algorithm to make the number of
branching layer,get optimal solution and reduce the wasting
time on insertion sequence。
|
|---|
