Minimizing cycle time for PCB assembly lines: An integer programming model and a branch-and-bound approach

Ping Ji, Y. F. Wan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

Abstract

Printed circuit board (PCB) assembly is popular in today's electronic manufacturing industry while component placement is critical in PCB assembly since it determines the efficiency and productivity of a PCB assembly line. This paper first discusses a cycle time determination problem in a PCB assembly line. Then the problem is formulated into a pure integer programming model with the objective of minimizing the cycle time of the PCB assembly line. Furthermore, the mathematical model is solved by the branch-and-bound (B&B) algorithm in order to get the optimal solution. Finally, a numerical example is presented to illustrate the mathematical model and the B&B algorithm.
Original languageEnglish
Pages (from-to)237-243
Number of pages7
JournalInternational Journal of Information and Management Sciences
Volume19
Issue number2
Publication statusPublished - 1 Jun 2008

Keywords

  • Branch-and-bound (B&B) algorithm
  • Integer programming
  • PCB assembly
  • Planning and control

ASJC Scopus subject areas

  • Management Information Systems
  • Industrial and Manufacturing Engineering

Cite this