The processing time optimization of printed circuit board

The purpose of this paper is to demonstrate the optimization of printed circuit board (PCB) manufacturing by improving drilling process productivity.

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.

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.

The paper does not treat the optimization of the drilling process parameters, even if reduction of the drilling time using optimized cutting parameters also represents an efficient method for improving the productivity.

The paper shows the influence of the algorithm performance for solving the TSP on the processing time minimization, by decreasing the component of drill movement time along the drill path between holes. Additionally, the conditions in which stacking a specific number of PCBs is advantageous are also investigated. Furthermore, the paper shows how to determine the optimum number of stacked PCBs.