Advanced Search
MyIDEAS: Login to save this paper or follow this series

An Aggregated Optimization Model for Multi-Head SMD Placements


Author Info

  • Ashayeri, J.
  • Ma, N.
  • Sotirov, R.

    (Tilburg University, Center for Economic Research)


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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2010-46.

as in new window
Date of creation: 2010
Date of revision:
Handle: RePEc:dgr:kubcen:201046

Contact details of provider:
Web page:

Related research

Keywords: Multi-head surface mounting device; Component placement; Variable placement speed;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:


No references listed on IDEAS
You can help add them by filling out this form.



This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:201046. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.