The processing time optimization of printed circuit board

Purpose – The purpose of this paper is to demonstrate the optimization of printed circuit board (PCB) manufacturing by improving drilling process productivity.Design/methodology/approach – Two different ways are explored to increase the productivity of the PCB drilling operation. The first way involves the minimization of the cutting‐tool path length. The second way to achieve the objective explores the efficiency of processing stacked PCBs.Findings – To reduce the tool path length between the holes of a PCB, a heuristic hybrid algorithm to solve the traveling salesman problem (TSP) is briefly described. Also, a mathematical model to calculate the total processing time is proposed. Based on this model, the paper shows the optimal number of stacked PCBs that can be profitably processed, while high processing productivity does not always mean high number of stacked PCBs.Research limitations/implications – The paper does not treat the optimization of the drilling process parameters, even if reduction of the ...

[1]  Martin W. Simmen.  Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem , 1991, Neural Computation.

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[4]  Fang-Chih Tien,et al.  Automated visual inspection for microdrills in printed circuit board production , 2004 .

[5]  John Knox,et al.  Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..

[6]  L. Kudła,et al.  Influence of feed motion features on small holes drilling process , 2001 .

[7]  Jy Liu,et al.  A study on heuristic methods for PCB drilling route optimization , 1999 .

[8]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[9]  Carsten Peterson,et al.  A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..

[10]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[11]  X. Xu,et al.  Effective neural algorithms for the traveling salesman problem , 1991, Neural Networks.

[12]  Mircea Ancu,et al.  The optimization of printed circuit board manufacturing by improving the drilling process productivity , 2008 .

[13]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[16]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[17]  W. Kao,et al.  Tribological characteristics and cutting performance of Crx% C-coated carbide tools , 2004 .

[18]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[19]  Toshiki Hirogaki,et al.  Optimizing drilling conditions in printed circuit board by considering hole quality: Optimization from viewpoint of drill-movement time , 2004 .

[20]  PCB drillability: a material science approach to resin development , 2004 .

[21]  Antonia J. Jones,et al.  Evolutionary Divide and Conquer (I): A Novel Genetic Approach to the TSP , 1993, Evolutionary Computation.

[22]  Carsten Peterson,et al.  Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem , 1990, Neural Computation.

[23]  Jung-Fa Hsieh,et al.  Mathematical model for helical drill point , 2005 .