Optimizing PCB assembly for family setup strategy

Yongzhong Wu, Ping Ji, William Ho

Research output: Contribution to journalArticle

Abstract

Purpose – The purpose of this paper is to investigate the optimization for a placement machine in printed circuit board (PCB) assembly when family setup strategy is adopted. Design/methodology/approach – A complete mathematical model is developed for the integrated problem to optimize feeder arrangement and component placement sequences so as to minimize the makespan for a set of PCB batches. Owing to the complexity of the problem, a specific genetic algorithm (GA) is proposed. Findings – The established model is able to find the minimal makespan for a set of PCB batches through determining the feeder arrangement and placement sequences. However, exact solutions to the problem are not practical due to the complexity. Experimental tests show that the proposed GA can solve the problem both effectively and efficiently. Research limitations/implications – When a placement machine is set up for production of a set of PCB batches, the feeder arrangement of the machine together with the component placement sequencing for each PCB type should be solved simultaneously so as to minimize the overall makespan. Practical implications – The paper investigates the optimization for PCB assembly with family setup strategy, which is adopted by many PCB manufacturers for reducing both setup costs and human errors. Originality/value – The paper investigates the feeder arrangement and placement sequencing problems when family setup strategy is adopted, which has not been studied in the literature.
Original languageEnglish
Pages (from-to)61-67
Number of pages7
JournalAssembly Automation
Volume29
Issue number1
DOIs
Publication statusPublished - 2009

Fingerprint

Printed circuit boards
Mathematical models
Costs

Keywords

  • assembly
  • printed circuits
  • process planning
  • process efficiency

Cite this

Wu, Yongzhong ; Ji, Ping ; Ho, William. / Optimizing PCB assembly for family setup strategy. In: Assembly Automation. 2009 ; Vol. 29, No. 1. pp. 61-67.
@article{b7ab225b8b1b4001adebb032ee4bb453,
title = "Optimizing PCB assembly for family setup strategy",
abstract = "Purpose – The purpose of this paper is to investigate the optimization for a placement machine in printed circuit board (PCB) assembly when family setup strategy is adopted. Design/methodology/approach – A complete mathematical model is developed for the integrated problem to optimize feeder arrangement and component placement sequences so as to minimize the makespan for a set of PCB batches. Owing to the complexity of the problem, a specific genetic algorithm (GA) is proposed. Findings – The established model is able to find the minimal makespan for a set of PCB batches through determining the feeder arrangement and placement sequences. However, exact solutions to the problem are not practical due to the complexity. Experimental tests show that the proposed GA can solve the problem both effectively and efficiently. Research limitations/implications – When a placement machine is set up for production of a set of PCB batches, the feeder arrangement of the machine together with the component placement sequencing for each PCB type should be solved simultaneously so as to minimize the overall makespan. Practical implications – The paper investigates the optimization for PCB assembly with family setup strategy, which is adopted by many PCB manufacturers for reducing both setup costs and human errors. Originality/value – The paper investigates the feeder arrangement and placement sequencing problems when family setup strategy is adopted, which has not been studied in the literature.",
keywords = "assembly, printed circuits, process planning, process efficiency",
author = "Yongzhong Wu and Ping Ji and William Ho",
year = "2009",
doi = "10.1108/01445150910929875",
language = "English",
volume = "29",
pages = "61--67",
journal = "Assembly Automation",
issn = "0144-5154",
publisher = "Emerald Group Publishing Ltd.",
number = "1",

}

Optimizing PCB assembly for family setup strategy. / Wu, Yongzhong; Ji, Ping; Ho, William.

In: Assembly Automation, Vol. 29, No. 1, 2009, p. 61-67.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimizing PCB assembly for family setup strategy

AU - Wu, Yongzhong

AU - Ji, Ping

AU - Ho, William

PY - 2009

Y1 - 2009

N2 - Purpose – The purpose of this paper is to investigate the optimization for a placement machine in printed circuit board (PCB) assembly when family setup strategy is adopted. Design/methodology/approach – A complete mathematical model is developed for the integrated problem to optimize feeder arrangement and component placement sequences so as to minimize the makespan for a set of PCB batches. Owing to the complexity of the problem, a specific genetic algorithm (GA) is proposed. Findings – The established model is able to find the minimal makespan for a set of PCB batches through determining the feeder arrangement and placement sequences. However, exact solutions to the problem are not practical due to the complexity. Experimental tests show that the proposed GA can solve the problem both effectively and efficiently. Research limitations/implications – When a placement machine is set up for production of a set of PCB batches, the feeder arrangement of the machine together with the component placement sequencing for each PCB type should be solved simultaneously so as to minimize the overall makespan. Practical implications – The paper investigates the optimization for PCB assembly with family setup strategy, which is adopted by many PCB manufacturers for reducing both setup costs and human errors. Originality/value – The paper investigates the feeder arrangement and placement sequencing problems when family setup strategy is adopted, which has not been studied in the literature.

AB - Purpose – The purpose of this paper is to investigate the optimization for a placement machine in printed circuit board (PCB) assembly when family setup strategy is adopted. Design/methodology/approach – A complete mathematical model is developed for the integrated problem to optimize feeder arrangement and component placement sequences so as to minimize the makespan for a set of PCB batches. Owing to the complexity of the problem, a specific genetic algorithm (GA) is proposed. Findings – The established model is able to find the minimal makespan for a set of PCB batches through determining the feeder arrangement and placement sequences. However, exact solutions to the problem are not practical due to the complexity. Experimental tests show that the proposed GA can solve the problem both effectively and efficiently. Research limitations/implications – When a placement machine is set up for production of a set of PCB batches, the feeder arrangement of the machine together with the component placement sequencing for each PCB type should be solved simultaneously so as to minimize the overall makespan. Practical implications – The paper investigates the optimization for PCB assembly with family setup strategy, which is adopted by many PCB manufacturers for reducing both setup costs and human errors. Originality/value – The paper investigates the feeder arrangement and placement sequencing problems when family setup strategy is adopted, which has not been studied in the literature.

KW - assembly

KW - printed circuits

KW - process planning

KW - process efficiency

UR - http://www.scopus.com/inward/record.url?scp=67651052285&partnerID=8YFLogxK

UR - http://www.emeraldinsight.com/journals.htm?articleid=1771080&show=abstract

U2 - 10.1108/01445150910929875

DO - 10.1108/01445150910929875

M3 - Article

VL - 29

SP - 61

EP - 67

JO - Assembly Automation

JF - Assembly Automation

SN - 0144-5154

IS - 1

ER -