IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v92y1999i0p381-40110.1023-a1018903302505.html
   My bibliography  Save this article

The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly

Author

Listed:
  • J.I. van Zante-de Fokkert
  • A.G. de Kok

Abstract

The planning and scheduling of repetitive PCB assembly is usually very complicated.In this paper, we propose a solution method for the simultaneous determination of theassignment of different PCB types to capacity constrained assembly lines, the assemblycycle times of the PCB types, and the reorder intervals of the required component types.This method takes the limited capacity into account as well as the component commonality ofthe PCB types. The solution method consists of two heuristics. The first heuristic determinesthe cycle times of the PCB types and the reorder intervals of the component types in orderto minimise the sum of the set‐up, holding, and ordering costs for given assignments.This method is used as a sub‐algorithm in the second heuristic, a local searchalgorithm. The latter heuristic defines an assignment for which a local minimum of cost isachieved. A case study has been carried out in which the algorithm has been applied toreal‐life data. It appears that the present cost can be reduced by almost 38%. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • J.I. van Zante-de Fokkert & A.G. de Kok, 1999. "The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly," Annals of Operations Research, Springer, vol. 92(0), pages 381-401, January.
    • Handle: RePEc:spr:annopr:v:92:y:1999:i:0:p:381-401:10.1023/a:1018903302505
    DOI: 10.1023/A:1018903302505
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018903302505
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018903302505?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:annopr:v:92:y:1999:i:0:p:381-401:10.1023/a:1018903302505. 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.