Genetic algorithm of determining cycle time for printed circuit board assembly lines

Ping Ji, M. T. Sze, Wing Bun Lee

Research output: Journal article publicationJournal articleAcademic researchpeer-review

44 Citations (Scopus)


The problem of allocating components to a printed circuit board (PCB) assembly line, which has several nonidentical placement machines in series, is formulated as a minimax-type integer programming (IP) model in this paper. In order to achieve the best production throughput, the objective of the model is to minimize the cycle time of the assembly line. The IP model is proven to be NP-complete (non-deterministic polynomial), so a genetic algorithm (GA) is developed for the cycle time determination problem in this paper. Finally, the efficiency of the genetic algorithm is illustrated by a numerical example.
Original languageEnglish
Pages (from-to)175-184
Number of pages10
JournalEuropean Journal of Operational Research
Issue number1
Publication statusPublished - 1 Jan 2001

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this