Heuristic approaches for batching jobs in printed circuit board assembly

Susan K Williams, Michael J. Magazine

Research output: Contribution to journalArticle

3 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 languageEnglish (US)
Pages (from-to)1943-1962
Number of pages20
JournalComputers and Operations Research
Volume34
Issue number7
DOIs
StatePublished - Jul 2007

    Fingerprint

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