IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04279956.html
   My bibliography  Save this paper

Dispatching Method Based on Particle Swarm Optimization for Make-to-Availability

Author

Listed:
  • R.F. Castro
  • Moacir Godinho Filho

    (Métis Lab EM Normandie - EM Normandie - École de Management de Normandie)

  • R.F. Tavares-Neto

Abstract

Make-to-availability (MTA) is a subtype of make-to-stock that emerged from production, planning, and control system, simplified drum-buffer-rope (S-DBR). The dispatching production order logic of the MTA does not consider the elements present in a wide range of manufacturing systems, such as sequence-dependent setup time. These characteristics generally creates difficulties in the S-DBR, thereby worsening performance indicators, such as mean flow time, setup time, and stock replenishment frequency. Given this research gap, the present study aims to develop a dispatching method for production orders in MTA, based on the particle swarm optimization (PSO) metaheuristic. The dispatching method aims to minimize the mean flow time, setup time, and stock levels in environments with a dependent setup time. To evaluate the performance of the new dispatching method, we used computational simulation to compare this method and the MTA dispatching logic. The results showed that the PSO for sequence achieved better performance, reducing the mean flow time, setup time, and stock level. \textcopyright 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Suggested Citation

  • R.F. Castro & Moacir Godinho Filho & R.F. Tavares-Neto, 2022. "Dispatching Method Based on Particle Swarm Optimization for Make-to-Availability," Post-Print hal-04279956, HAL.
  • Handle: RePEc:hal:journl:hal-04279956
    DOI: 10.1007/s10845-020-01707-6
    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 search for a similarly titled item that would be available.

    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:hal:journl:hal-04279956. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.