Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reduction of printed circuit board group assembly time through the consideration of efficiency loss of placement time

Reduction of printed circuit board group assembly time through the consideration of efficiency... In a high‐mix middle‐volume production environment for printed circuit board (PCB) assembly, the production efficiency strongly depends not only on the tactical level of how to group PCBs but also on the operational level of how to assign feeders and determine placement sequences in the group setup strategy. The present study discusses the problem of clustering PCBs into groups in such a way that total placement and setup time can be minimized. This problem is motivated by a situation that the reduction of group setup‐time and efficiency loss of placement time should be balanced in a PCB group setup optimization. This research incorporates placement time into the PCB job grouping and presents a weighting similarity measure. To solve component‐feeder assignment and placement sequences for a family of PCBs, an efficient procedure based upon an ant colony optimization (ACO) algorithm is developed. Group setup performance is evaluated and compared under a variety of grouping algorithms. Experiments are conducted to discover situations where the consideration of efficiency loss of placement time can make a significant improvement in PCB group assembly. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Assembly Automation Emerald Publishing

Reduction of printed circuit board group assembly time through the consideration of efficiency loss of placement time

Wei‐Shing Chen; Chiuh‐Cheng Chyu
Assembly Automation , Volume 22 (4): 11 – Dec 1, 2002
Download PDF
11 pages

Loading next page...
 
/lp/emerald-publishing/reduction-of-printed-circuit-board-group-assembly-time-through-the-738c93YsBs
Publisher
Emerald Publishing
Copyright
Copyright © 2002 MCB UP Ltd. All rights reserved.
ISSN
0144-5154
DOI
10.1108/01445150210446238
Publisher site
See Article on Publisher Site

Abstract

In a high‐mix middle‐volume production environment for printed circuit board (PCB) assembly, the production efficiency strongly depends not only on the tactical level of how to group PCBs but also on the operational level of how to assign feeders and determine placement sequences in the group setup strategy. The present study discusses the problem of clustering PCBs into groups in such a way that total placement and setup time can be minimized. This problem is motivated by a situation that the reduction of group setup‐time and efficiency loss of placement time should be balanced in a PCB group setup optimization. This research incorporates placement time into the PCB job grouping and presents a weighting similarity measure. To solve component‐feeder assignment and placement sequences for a family of PCBs, an efficient procedure based upon an ant colony optimization (ACO) algorithm is developed. Group setup performance is evaluated and compared under a variety of grouping algorithms. Experiments are conducted to discover situations where the consideration of efficiency loss of placement time can make a significant improvement in PCB group assembly.

Journal

Assembly Automation – Emerald Publishing

Published: Dec 1, 2002

Keywords: Printed circuit boards; Assembly

References

  • Computer‐aided process planning in printed circuit card assembly
    Ammons, J.C.; Caryyle, W.M.; Depuy, G.W.; Ellis, K.P.; McGinnis, L.F.; Tovey, G.A.; Xu, H.
  • Sequencing of insertion in PCB assembly
    Ball, M.O.; Magazine, M.J.
  • Grouping PCBs for set‐up reduction: a maximum spanning tree approach
    Bhaskar, G.; Narendran, T.T.
  • Group set‐up for printed circuit board assembly
    Carmon, T.F.; Maimon, O.Z.; Dar‐El, E.M.
  • Grouping components in printed circuit board assembly with limited components staging capacity and single card setup: problem characteristics and solution procedures
    Daskin, M.S.; Maimon, O.; Shtub, A.; Braha, D.
  • Ant colony system: a cooperative learning approach to the traveling salesman problem
    Dorigo, M.
  • Ant system: optimization by a colony of cooperating agents
    Dorigo, M.; Maniezzo, V.; Colorni, A.
  • Sequencing methods for single in‐line packages in PCB assembly
    Downs, K.A.; Linn, R.J.; Martinson, N.L.
  • PCB assembly set‐up reduction using Group Technology
    Hashiba, S.; Chang, T.C.
  • Optimization of the movements of a component placement machine
    Leipala, T.; Nevalainen, O.
  • Planning of component placement/insertion sequence and feeder setup in PCB assembly
    Leu, M.C.; Wang, H.; Ji, Z.
  • Grouping methods for printed circuit board assembly
    Maimon, O.Z.; Shtub, A.
  • The ant system applied to the quadratic assignment problem
    Maniezzo, V.; Colorni, A.
  • Automated process planning for printed circuit card assembly
    McGinnis, L.F.; Ammons, J.C.; Carlyle, M.; Cranmer, L.; Depuy, G.W.; Ellis, K.P.; Tovey, C.A.; Xu, H.
  • Simultaneously component sequencing and feeder assignment for high speed chip shooter machines
    Moyer, L.K.; Gupta, S.M.
  • An optimal assembly model of multi‐type printed circuit boards
    Ohno, K.; Zin, Z.; Elmagrhaby, S.E.
  • Genetic algorithm approach in PCB assembly
    Ong, N.; Khoo, P.
  • Sequence placement planning for high‐speed PCB assembly machine
    Ong, N.; Tan, W.
  • Role of similarity measures in PCB grouping procedures
    Shtub, A.; Maimon, O.
  • A dynamic points specification approach to sequencing robot moves for PCB assembly
    Su, Y.S.; Wang, C.; Egbelu, P.J.; Cannon, D.J.
  • Parallel ant colonies for the quadratic assignment problem
    Talbi, E.G.; Roux, O.; Fonlupt, C.; Robillard, D.