TY - JOUR
T1 - An efficient algorithm for drilling printed circuit boards
AU - Danusaputro, Surya
AU - Lee, Chung Yee
AU - Martin-Vega, Louis A.
PY - 1990
Y1 - 1990
N2 - This paper describes an applied research project carried out for a major electronics manufacturer in Florida. The objective of the project was to develop an algorithm that would minimize the total moving time for drilling holes in printed cicuit boards. The algorithm that is developed combines a "nearest neighbor" heuristic with a clustering procedure that takes advantage of the natural structure or location of points on the boards. Comparison of the new algorithm with the procedure previously used by the manufacturer demonstrated significant savings in the average travel times. These results as well as other features of the new algorithm are also discussed.
AB - This paper describes an applied research project carried out for a major electronics manufacturer in Florida. The objective of the project was to develop an algorithm that would minimize the total moving time for drilling holes in printed cicuit boards. The algorithm that is developed combines a "nearest neighbor" heuristic with a clustering procedure that takes advantage of the natural structure or location of points on the boards. Comparison of the new algorithm with the procedure previously used by the manufacturer demonstrated significant savings in the average travel times. These results as well as other features of the new algorithm are also discussed.
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:A1990CY19900005
UR - https://openalex.org/W2040682904
U2 - 10.1016/0360-8352(90)90025-H
DO - 10.1016/0360-8352(90)90025-H
M3 - Journal Article
SN - 0360-8352
VL - 18
SP - 145
EP - 151
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
IS - 2
ER -