IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v33y2019i2p252-270.html
   My bibliography  Save this article

Optimal buffer allocation for serial production lines using heuristic search algorithms: a comparative study

Author

Listed:
  • Leyla Demir
  • Alexandros C. Diamantidis
  • Deniz Türsel Eliiyi
  • M.E.J. O'Kelly
  • Semra Tunali

Abstract

The buffer allocation problem (BAP) is one of the major optimisation problems faced by production system designers. BAP is widely studied in the literature since buffers have a great impact on efficiency of production lines. This paper deals with buffer allocation problem and compares the performance of three heuristic search algorithms, namely myopic algorithm (MA), degraded ceiling (DC), and adaptive tabu search (ATS) with respect to both throughput maximisation and also computational time. To generalise experimental findings the experiments have been conducted both for reliable and also unreliable serial production lines over various sizes of problem instances. It is hoped that the findings of this research study can serve as a guideline for the decision makers while designing and operating production lines.

Suggested Citation

  • Leyla Demir & Alexandros C. Diamantidis & Deniz Türsel Eliiyi & M.E.J. O'Kelly & Semra Tunali, 2019. "Optimal buffer allocation for serial production lines using heuristic search algorithms: a comparative study," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 33(2), pages 252-270.
    • Handle: RePEc:ids:ijisen:v:33:y:2019:i:2:p:252-270
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=102473
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijisen:v:33:y:2019:i:2:p:252-270. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.