An aggregated optimization model for multi-head SMD placements

J. Ashayeri, N. Ma, R. Sotirov

Research output: Contribution to journalArticleScientificpeer-review

Abstract

In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads, minimizing the number of nozzle exchanges, and improving handling class. The handling class which specifies the traveling speed of the robot arm, to the best of our knowledge, has been for the first time incorporated in an optimization model. While the MIP produces an optimal planning for batches of components, a new sequencing heuristics is developed in order to determine the final sequence of component placements based on the outputs of the MIP. This two-stage approach guarantees a good feasible solution to the multi-head SMD placement optimization problem. The computational performance is examined using real industrial data.
Original languageEnglish
Pages (from-to)99-105
JournalComputers and Industrial Engineering: An international journal
Volume60
Issue number1
DOIs
Publication statusPublished - 2011

Fingerprint

Surface mount technology
Nozzles
Robots
Planning

Cite this

@article{31e40596981d4cfda930c673a22d45ce,
title = "An aggregated optimization model for multi-head SMD placements",
abstract = "In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads, minimizing the number of nozzle exchanges, and improving handling class. The handling class which specifies the traveling speed of the robot arm, to the best of our knowledge, has been for the first time incorporated in an optimization model. While the MIP produces an optimal planning for batches of components, a new sequencing heuristics is developed in order to determine the final sequence of component placements based on the outputs of the MIP. This two-stage approach guarantees a good feasible solution to the multi-head SMD placement optimization problem. The computational performance is examined using real industrial data.",
author = "J. Ashayeri and N. Ma and R. Sotirov",
note = "Appeared earlier as CentER DP 2010-46",
year = "2011",
doi = "10.1016/j.cie.2010.10.004",
language = "English",
volume = "60",
pages = "99--105",
journal = "Computers & Industrial Engineering: An international journal",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "1",

}

An aggregated optimization model for multi-head SMD placements. / Ashayeri, J.; Ma, N.; Sotirov, R.

In: Computers and Industrial Engineering: An international journal, Vol. 60, No. 1, 2011, p. 99-105.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - An aggregated optimization model for multi-head SMD placements

AU - Ashayeri, J.

AU - Ma, N.

AU - Sotirov, R.

N1 - Appeared earlier as CentER DP 2010-46

PY - 2011

Y1 - 2011

N2 - In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads, minimizing the number of nozzle exchanges, and improving handling class. The handling class which specifies the traveling speed of the robot arm, to the best of our knowledge, has been for the first time incorporated in an optimization model. While the MIP produces an optimal planning for batches of components, a new sequencing heuristics is developed in order to determine the final sequence of component placements based on the outputs of the MIP. This two-stage approach guarantees a good feasible solution to the multi-head SMD placement optimization problem. The computational performance is examined using real industrial data.

AB - In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads, minimizing the number of nozzle exchanges, and improving handling class. The handling class which specifies the traveling speed of the robot arm, to the best of our knowledge, has been for the first time incorporated in an optimization model. While the MIP produces an optimal planning for batches of components, a new sequencing heuristics is developed in order to determine the final sequence of component placements based on the outputs of the MIP. This two-stage approach guarantees a good feasible solution to the multi-head SMD placement optimization problem. The computational performance is examined using real industrial data.

U2 - 10.1016/j.cie.2010.10.004

DO - 10.1016/j.cie.2010.10.004

M3 - Article

VL - 60

SP - 99

EP - 105

JO - Computers & Industrial Engineering: An international journal

JF - Computers & Industrial Engineering: An international journal

SN - 0360-8352

IS - 1

ER -