IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i10p3001-3017.html
   My bibliography  Save this article

Buffer allocation design for unreliable production lines using genetic algorithm and finite perturbation analysis

Author

Listed:
  • Khelil Kassoul
  • Naoufel Cheikhrouhou
  • Nicolas Zufferey

Abstract

The buffer allocation problem in production lines is an NP-hard combinatorial optimisation problem. This paper proposes a new hybrid optimisation approach (using simulation) relying on genetic algorithm (GA) and finite perturbation analysis (FPA). Unlike the infinitesimal perturbation analysis, which deals with small (infinitesimal variation) perturbations for estimating gradients of the performance measure, FPA deals with larger (finite) or more lasting perturbations. It is an extension specifically dedicated to discrete decision variables and applicable to most discrete-event dynamic systems. The proposed method allows a global search using GA, with refinement in specific solution-space regions using FPA. The main objective is to maximise the average production rate of a production line with unreliable machines, by allocating the total buffer capacity in locations between machines. Extensive numerical experiments show that: (1) the proposed hybrid GA-FPA method clearly outperforms the state-of-the-art methods from the literature; (2) combining FPA and GA is beneficial when compared to employing GA or FPA independently.

Suggested Citation

  • Khelil Kassoul & Naoufel Cheikhrouhou & Nicolas Zufferey, 2022. "Buffer allocation design for unreliable production lines using genetic algorithm and finite perturbation analysis," International Journal of Production Research, Taylor & Francis Journals, vol. 60(10), pages 3001-3017, May.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:10:p:3001-3017
    DOI: 10.1080/00207543.2021.1909169
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1909169
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1909169?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:taf:tprsxx:v:60:y:2022:i:10:p:3001-3017. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.