Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Grouping and Sequencing PCB As...

Grouping and Sequencing PCB Assembly Jobs with Minimum Feeder Setups

Kari Salonen, Jouni Smed, Mika Johnsson, Olli Nevalainen, Grouping and Sequencing PCB Assembly Jobs with Minimum Feeder Setups. TUCS Technical Reports 484, Turku Centre for Computer Science, 2002.

Abstract:

Printed circuit boards (PCBs) are manufactured in automated assembly lines, where high-speed placement machines put components on the boards. These machines are frequently bottlenecks in the production. This is true especially in high-mix low-volume environments, where time consuming setup operations of the machines have to be done repeatedly. Therefore, one can improve productivity with a proper setup strategy. The most popular strategies in a single machine case are the so-called group setup strategy and minimum setup strategy. In this paper, we consider the machine setup problem as a combination of a job grouping problem and a minimum setup problem. We formulate this joint problem as a MIP-model, where the objective is to minimize the weighted sum of the number of setup occasions and the total number of component feeder changes. We also present and evaluate hybrid algorithms based on both grouping and minimum setup heuristics. The best results are achieved by a method which uses both these strategies simultaneously.

BibTeX entry:

@TECHREPORT{tSaSmJoNe02a,
  title = {Grouping and Sequencing PCB Assembly Jobs with Minimum Feeder Setups},
  author = {Salonen, Kari and Smed, Jouni and Johnsson, Mika and Nevalainen, Olli},
  number = {484},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2002},
  ISBN = {952-12-1060-5},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication