Heuristic approaches for batching jobs in printed circuit board assembly

Susan K Williams, Michael J. Magazine

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The goal of the printed circuit board job-batching problem is to minimize the total manufacturing time required to process a set of printed circuit board jobs on an insertion machine. We have developed four families of heuristics to solve this problem: the clustering family, the bin-packing family, a family of sequencing genetic algorithms, and a grouping genetic algorithm. Within each family of heuristics, we developed several variations. Some of the variations use techniques from the literature and some of the techniques we developed specifically for this problem. We test the variations and select a good performer from each family.

Original languageEnglish (US)
Pages (from-to)1943-1962
Number of pages20
JournalComputers and Operations Research
Volume34
Issue number7
DOIs
StatePublished - Jul 2007

Fingerprint

Batching
Printed Circuit Board
Printed circuit boards
heuristics
Genetic algorithms
Heuristics
Bins
Genetic Algorithm
Bin Packing
Grouping
grouping
Sequencing
Insertion
Family
Printed circuit board
manufacturing
Manufacturing
Clustering
Minimise
Genetic algorithm

Keywords

  • Clustering
  • Genetic algorithms
  • Heuristics
  • Printed-circuit-board assembly

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Heuristic approaches for batching jobs in printed circuit board assembly. / Williams, Susan K; Magazine, Michael J.

In: Computers and Operations Research, Vol. 34, No. 7, 07.2007, p. 1943-1962.

Research output: Contribution to journalArticle

@article{7cd45125cd504561bea494753b56dfb8,
title = "Heuristic approaches for batching jobs in printed circuit board assembly",
abstract = "The goal of the printed circuit board job-batching problem is to minimize the total manufacturing time required to process a set of printed circuit board jobs on an insertion machine. We have developed four families of heuristics to solve this problem: the clustering family, the bin-packing family, a family of sequencing genetic algorithms, and a grouping genetic algorithm. Within each family of heuristics, we developed several variations. Some of the variations use techniques from the literature and some of the techniques we developed specifically for this problem. We test the variations and select a good performer from each family.",
keywords = "Clustering, Genetic algorithms, Heuristics, Printed-circuit-board assembly",
author = "Williams, {Susan K} and Magazine, {Michael J.}",
year = "2007",
month = "7",
doi = "10.1016/j.cor.2005.07.023",
language = "English (US)",
volume = "34",
pages = "1943--1962",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Heuristic approaches for batching jobs in printed circuit board assembly

AU - Williams, Susan K

AU - Magazine, Michael J.

PY - 2007/7

Y1 - 2007/7

N2 - The goal of the printed circuit board job-batching problem is to minimize the total manufacturing time required to process a set of printed circuit board jobs on an insertion machine. We have developed four families of heuristics to solve this problem: the clustering family, the bin-packing family, a family of sequencing genetic algorithms, and a grouping genetic algorithm. Within each family of heuristics, we developed several variations. Some of the variations use techniques from the literature and some of the techniques we developed specifically for this problem. We test the variations and select a good performer from each family.

AB - The goal of the printed circuit board job-batching problem is to minimize the total manufacturing time required to process a set of printed circuit board jobs on an insertion machine. We have developed four families of heuristics to solve this problem: the clustering family, the bin-packing family, a family of sequencing genetic algorithms, and a grouping genetic algorithm. Within each family of heuristics, we developed several variations. Some of the variations use techniques from the literature and some of the techniques we developed specifically for this problem. We test the variations and select a good performer from each family.

KW - Clustering

KW - Genetic algorithms

KW - Heuristics

KW - Printed-circuit-board assembly

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

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

U2 - 10.1016/j.cor.2005.07.023

DO - 10.1016/j.cor.2005.07.023

M3 - Article

VL - 34

SP - 1943

EP - 1962

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 7

ER -