Heuristic approaches for batching jobs in printed circuit board assembly

Susan K. Williams; Michael J. Magazine

doi:10.1016/j.cor.2005.07.023

Heuristic approaches for batching jobs in printed circuit board assembly

Susan K. Williams, Michael J. Magazine

Business, The W.A. Franke College of (CoB)

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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 language	English (US)
Pages (from-to)	1943-1962
Number of pages	20
Journal	Computers and Operations Research
Volume	34
Issue number	7
DOIs	https://doi.org/10.1016/j.cor.2005.07.023
State	Published - Jul 2007

Keywords

Clustering
Genetic algorithms
Heuristics
Printed-circuit-board assembly

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2005.07.023

Cite this

@article{b339bd8355a647c6b32930917cd93046,

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 = jul,

doi = "10.1016/j.cor.2005.07.023",

language = "English (US)",

volume = "34",

pages = "1943--1962",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "North-Holland Publ Co",

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

SN - 0305-0548

VL - 34

SP - 1943

EP - 1962

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 7

ER -

Heuristic approaches for batching jobs in printed circuit board assembly

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this