Component pick and place scheduling for surface mount device placement machine

Masri Ayob, Mohd Zakree Ahmad Nazri, Suhaila Zainuddin, Tri Basuki Kurniawan

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This is a case study on improving the throughput of a pick and place surface mount device placement machine. These machines are designed to place electronic components onto a printed circuit board. The machines considered in this research are economical and medium speed machines that have four fixed feeder carriers, a fixed printed circuit board table, two vision cameras, a tool bank, a trash bin and a positioning arm head (i.e., a head that is moveable in both X and Y axes simultaneously) that is equipped with two pipettes. A nozzle (which is held by a pipette) is used to grasp the components for the pick and place operations. As nozzle change operations are very time consuming the constructive heuristic presented in this study gives priority to reducing the number of nozzle change operations in order to schedule the component pick and place operations when assembling printed circuit boards. Based on the average machine operation time provided by the machine manufacturer we compute the effectiveness of each pick and place operation type and assign a weighted value for each type of the operation. The nozzle pairs are ranked based on their effectiveness that indicates how many good pick and place operations can be performed by the nozzle pair. The heuristic begins by choosing the best nozzle pair to be applied. Computational results show that, on average, a weighted nozzle rank heuristic is superior to an ordered heuristic that was presented in the earlier research.

Original languageEnglish
Pages (from-to)29-41
Number of pages13
JournalInternational Journal of Soft Computing
Volume8
Issue number1
DOIs
Publication statusPublished - 2013

Fingerprint

Nozzle
Placement
Nozzles
Scheduling
Printed Circuit Board
Printed circuit boards
Heuristics
Bins
Positioning
Assign
Computational Results
Cameras
Throughput
Table
Schedule
Camera
Electronics

Keywords

  • Component placement sequencing
  • Heuristic
  • Nozzle optimisation
  • Printed circuit board assembly
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Modelling and Simulation

Cite this

Component pick and place scheduling for surface mount device placement machine. / Ayob, Masri; Ahmad Nazri, Mohd Zakree; Zainuddin, Suhaila; Kurniawan, Tri Basuki.

In: International Journal of Soft Computing, Vol. 8, No. 1, 2013, p. 29-41.

Research output: Contribution to journalArticle

@article{bdbb9c2525e24c7b8e99ad589ec15f5f,
title = "Component pick and place scheduling for surface mount device placement machine",
abstract = "This is a case study on improving the throughput of a pick and place surface mount device placement machine. These machines are designed to place electronic components onto a printed circuit board. The machines considered in this research are economical and medium speed machines that have four fixed feeder carriers, a fixed printed circuit board table, two vision cameras, a tool bank, a trash bin and a positioning arm head (i.e., a head that is moveable in both X and Y axes simultaneously) that is equipped with two pipettes. A nozzle (which is held by a pipette) is used to grasp the components for the pick and place operations. As nozzle change operations are very time consuming the constructive heuristic presented in this study gives priority to reducing the number of nozzle change operations in order to schedule the component pick and place operations when assembling printed circuit boards. Based on the average machine operation time provided by the machine manufacturer we compute the effectiveness of each pick and place operation type and assign a weighted value for each type of the operation. The nozzle pairs are ranked based on their effectiveness that indicates how many good pick and place operations can be performed by the nozzle pair. The heuristic begins by choosing the best nozzle pair to be applied. Computational results show that, on average, a weighted nozzle rank heuristic is superior to an ordered heuristic that was presented in the earlier research.",
keywords = "Component placement sequencing, Heuristic, Nozzle optimisation, Printed circuit board assembly, Scheduling",
author = "Masri Ayob and {Ahmad Nazri}, {Mohd Zakree} and Suhaila Zainuddin and Kurniawan, {Tri Basuki}",
year = "2013",
doi = "10.3923/ijscomp.2013.29.41",
language = "English",
volume = "8",
pages = "29--41",
journal = "International Journal of Soft Computing",
issn = "1816-9503",
publisher = "Medwell Publishing",
number = "1",

}

TY - JOUR

T1 - Component pick and place scheduling for surface mount device placement machine

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

AU - Zainuddin, Suhaila

AU - Kurniawan, Tri Basuki

PY - 2013

Y1 - 2013

N2 - This is a case study on improving the throughput of a pick and place surface mount device placement machine. These machines are designed to place electronic components onto a printed circuit board. The machines considered in this research are economical and medium speed machines that have four fixed feeder carriers, a fixed printed circuit board table, two vision cameras, a tool bank, a trash bin and a positioning arm head (i.e., a head that is moveable in both X and Y axes simultaneously) that is equipped with two pipettes. A nozzle (which is held by a pipette) is used to grasp the components for the pick and place operations. As nozzle change operations are very time consuming the constructive heuristic presented in this study gives priority to reducing the number of nozzle change operations in order to schedule the component pick and place operations when assembling printed circuit boards. Based on the average machine operation time provided by the machine manufacturer we compute the effectiveness of each pick and place operation type and assign a weighted value for each type of the operation. The nozzle pairs are ranked based on their effectiveness that indicates how many good pick and place operations can be performed by the nozzle pair. The heuristic begins by choosing the best nozzle pair to be applied. Computational results show that, on average, a weighted nozzle rank heuristic is superior to an ordered heuristic that was presented in the earlier research.

AB - This is a case study on improving the throughput of a pick and place surface mount device placement machine. These machines are designed to place electronic components onto a printed circuit board. The machines considered in this research are economical and medium speed machines that have four fixed feeder carriers, a fixed printed circuit board table, two vision cameras, a tool bank, a trash bin and a positioning arm head (i.e., a head that is moveable in both X and Y axes simultaneously) that is equipped with two pipettes. A nozzle (which is held by a pipette) is used to grasp the components for the pick and place operations. As nozzle change operations are very time consuming the constructive heuristic presented in this study gives priority to reducing the number of nozzle change operations in order to schedule the component pick and place operations when assembling printed circuit boards. Based on the average machine operation time provided by the machine manufacturer we compute the effectiveness of each pick and place operation type and assign a weighted value for each type of the operation. The nozzle pairs are ranked based on their effectiveness that indicates how many good pick and place operations can be performed by the nozzle pair. The heuristic begins by choosing the best nozzle pair to be applied. Computational results show that, on average, a weighted nozzle rank heuristic is superior to an ordered heuristic that was presented in the earlier research.

KW - Component placement sequencing

KW - Heuristic

KW - Nozzle optimisation

KW - Printed circuit board assembly

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=84881333288&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84881333288&partnerID=8YFLogxK

U2 - 10.3923/ijscomp.2013.29.41

DO - 10.3923/ijscomp.2013.29.41

M3 - Article

VL - 8

SP - 29

EP - 41

JO - International Journal of Soft Computing

JF - International Journal of Soft Computing

SN - 1816-9503

IS - 1

ER -