A heuristic approach for component scheduling on a high-speed PCB assembly machine

William Ho*, Ping Ji, Y. Wu

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.

Original languageEnglish
Pages (from-to)655-665
Number of pages11
JournalProduction Planning and Control
Volume18
Issue number8
DOIs
Publication statusPublished - Dec 2007

Fingerprint

Assembly machines
Printed circuit boards
Scheduling
Genetic algorithms
Printed circuit board
Heuristics

Keywords

  • collect-and-place machines
  • component scheduling
  • hybrid genetic algorithm
  • printed circuit board assembly

Cite this

Ho, William ; Ji, Ping ; Wu, Y. / A heuristic approach for component scheduling on a high-speed PCB assembly machine. In: Production Planning and Control. 2007 ; Vol. 18, No. 8. pp. 655-665.
@article{d90c75dff96641f595d9d5da70c83a8c,
title = "A heuristic approach for component scheduling on a high-speed PCB assembly machine",
abstract = "The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.",
keywords = "collect-and-place machines, component scheduling, hybrid genetic algorithm, printed circuit board assembly",
author = "William Ho and Ping Ji and Y. Wu",
year = "2007",
month = "12",
doi = "10.1080/09537280701602683",
language = "English",
volume = "18",
pages = "655--665",
journal = "Production Planning and Control",
issn = "0953-7287",
publisher = "Taylor & Francis",
number = "8",

}

A heuristic approach for component scheduling on a high-speed PCB assembly machine. / Ho, William; Ji, Ping; Wu, Y.

In: Production Planning and Control, Vol. 18, No. 8, 12.2007, p. 655-665.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A heuristic approach for component scheduling on a high-speed PCB assembly machine

AU - Ho, William

AU - Ji, Ping

AU - Wu, Y.

PY - 2007/12

Y1 - 2007/12

N2 - The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.

AB - The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.

KW - collect-and-place machines

KW - component scheduling

KW - hybrid genetic algorithm

KW - printed circuit board assembly

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

UR - http://www.informaworld.com/openurl?genre=article&issn=0953-7287&volume=18&issue=8&spage=655

U2 - 10.1080/09537280701602683

DO - 10.1080/09537280701602683

M3 - Article

VL - 18

SP - 655

EP - 665

JO - Production Planning and Control

JF - Production Planning and Control

SN - 0953-7287

IS - 8

ER -