IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-00142-0_21.html
   My bibliography  Save this book chapter

Scheduling Component Placement Operations for Collect-and-Place Type PCB Assembly Machines

In: Operations Research Proceedings 2008

Author

Listed:
  • Özgür Kulak

    (Marmara University, Göztepe Campus, Department of Industrial Engineering)

  • Serol Bulkan

    (Marmara University, Göztepe Campus, Department of Industrial Engineering)

  • Hans-Otto Günther

    (Technical University of Berlin, Department of Production Management)

Abstract

Summary Component placement is one of the most time-consuming operations in printed circuit board (PCB) assembly and dominates the cycle time of any PCB assembly line. In our study, we focus on collect-and-place machines which first collect a number of electronic components from the component magazine and then place them one-by-one onto the PCB. With this type of machinery two problems arise, i.e. generating placement tours and determining the placement sequence within each tour. To solve these problems, an effecient clustering algorithm to create placement tours and two modified nearest neighbor algorithms (MNNHs) to determine the placement sequence are proposed. The objective is to minimise the assembly cycle time per board. Numerical experiments show that high-quality solutions are obtained within very short CPU time.

Suggested Citation

  • Özgür Kulak & Serol Bulkan & Hans-Otto Günther, 2009. "Scheduling Component Placement Operations for Collect-and-Place Type PCB Assembly Machines," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 21, pages 129-134, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-00142-0_21
    DOI: 10.1007/978-3-642-00142-0_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-00142-0_21. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.