본문 바로가기
  • Home

Heavy-Weight Component First Placement Algorithm for Minimizing Assembly Time of Printed Circuit Board Component Placement Machine

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(3), pp.57-64
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper deals with the PCB assembly time minimization problem that the PAP (pick-andplacement) machine pickup the  -weighted group of  -components, loading, and place into the PCB placement location. This problem considers the rotational turret velocity according to component weight group and moving velocity of distance in two component placement locations in PCB. This paper suggest heavy-weight component group first pick-and-place strategy that the feeder sequence fit to the placement location Hamiltonean cycle sequence. This algorithm applies the quadratic assignment problem (QAP) that considers feeder sequence and location sequence, and the linear assignment problem (LAP) that considers only feeder sequence. The proposed algorithm shorten the assembly time than iATMA for QAP, and same result as iATMA that shorten the assembly time than ATMA.

Citation status

* References for papers published after 2022 are currently being built.