The processing time optimization of printed circuit board

被引:4
作者
Ancau, Mircea [1 ]
机构
[1] Tech Univ Cluj Napoca, Cluj Napoca, Romania
关键词
Monte Carlo methods; Printed circuit boards; Strategic manufacturing; TRAVELING-SALESMAN PROBLEM; DRILLING PROCESS; PERFORMANCE; ALGORITHMS;
D O I
10.1108/03056120910979512
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 drilling time using optimized cutting parameters also represents an efficient method for improving the productivity. Originality/value - 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.
引用
收藏
页码:21 / 28
页数:8
相关论文
共 25 条
[1]   The optimization of printed circuit board manufacturing by improving the drilling process productivity [J].
Ancau, Mircea .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (02) :279-294
[2]   SELF-ORGANIZING FEATURE MAPS AND THE TRAVELING SALESMAN PROBLEM [J].
ANGENIOL, B ;
VAUBOIS, GD ;
LETEXIER, JY .
NEURAL NETWORKS, 1988, 1 (04) :289-293
[3]  
[Anonymous], J CHEM PHYS
[4]   Optimizing drilling conditions in printed circuit board by considering hole quality - Optimization from viewpoint of drill-movement time [J].
Aoyama, E ;
Hirogaki, T ;
Katayama, T ;
Hashimoto, N .
JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2004, 155 :1544-1550
[5]  
Bentley J. L., 1992, ORSA Journal on Computing, V4, P387, DOI 10.1287/ijoc.4.4.387
[6]   Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry [J].
Chang, Pei-Chann ;
Hsieh, Jih-Chang ;
Wang, Chih-Yuan .
APPLIED SOFT COMPUTING, 2007, 7 (03) :800-806
[7]   A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].
CROES, GA .
OPERATIONS RESEARCH, 1958, 6 (06) :791-812
[8]  
Frieze A.M., 1979, METHODS OPER RES, V32, P97
[9]   FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].
GLOVER, F .
COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549
[10]   Mathematical model for helical drill point [J].
Hsieh, JF .
INTERNATIONAL JOURNAL OF MACHINE TOOLS & MANUFACTURE, 2005, 45 (7-8) :967-977