Skip to main content
Log in

Selecting the nozzle assortment for a Gantry-type placement machine

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

Electronics manufacturing systems employ increasingly multi-head gantry machines, where several vacuum nozzles are used simultaneously in pick-and-place operations to insert components on bare PCBs. Their use includes several options that have an impact on the overall manufacturing speed of the machine. In the present paper we address the problem of selecting the nozzles for this kind of a gantry machine, which is an important subproblem of the larger scheduling problem of multi-head gantry machines. Nozzles come in different types, and different types of components may require different types of nozzles in their placing. We address first a case where a single PCB type is manufactured and the only limitation on the number of nozzles is given by the capacity of the placement head. Then we discuss the case where there is a budget limitation on the total cost of the nozzles we can buy. We show that both of these problems can be solved optimally by the means of efficient greedy algorithms. We also discuss the case of selecting nozzles when manufacturing multiple different PCB types.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ayob M, Kendall G (2003) Real-time scheduling for multi head placement machine. In: 5th IEEE int. symposium on assembly and task planning (ISATP’03), Besancom, France, pp 18–133

  2. Burke EK, Cowling PI, Keuthen R (2001) The printed circuit board assembly problem: heuristic approaches for multi-head placement machinery. In: Proceedings of the conference on artificial intelligence (IC-AI2000), vol III. CSREA Press, Las Vegas, pp 1456–1462

  3. Crama Y, van de Klundert J (1996) The approximability of tool management problems, Technical Report, Maastricht Economic Research School on Technology and Organizations

  4. Crama Y and Klundert J (1999). The worst-case performance of approximation algorithms for tool management problems. Naval Res Logist 46: 445–462

    Article  Google Scholar 

  5. Crama Y, Spieksma FCR and Klundert J (2002). Production planning problems in printed circuit board assembly. Discrete Appl Math 123: 339–361

    Article  Google Scholar 

  6. Ibaraki T, Katoh N (1988) Resource allocation problems: algorithmic approaches. The MIT Press, Cambridge. ISBN 0-262-09027-9

  7. Johnsson M (1999) Operational and tactical level optimization in printed circuit board assembly. TUCS Dissertations No. 16. Turku Centre for Computer Science

  8. Knuutila T, Pyöttiälä S and Nevalainen OS (2007). Minimizing the number of pickups on a multi-head placement machine. J Oper Res Soc 58: 115–121

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timo Knuutila.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raduly-Baka, C., Knuutila, T., Johnsson, M. et al. Selecting the nozzle assortment for a Gantry-type placement machine. OR Spectrum 30, 493–513 (2008). https://doi.org/10.1007/s00291-007-0108-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-007-0108-1

Keywords

Navigation