IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v33y2022i4d10.1007_s10845-020-01707-6.html
   My bibliography  Save this article

Dispatching method based on particle swarm optimization for make-to-availability

Author

Listed:
  • Robson Flavio Castro

    (Federal University of São Carlos – UFSCAR)

  • Moacir Godinho-Filho

    (Federal University of São Carlos – UFSCAR)

  • Roberto Fernandes Tavares-Neto

    (Federal University of São Carlos – UFSCAR)

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.

Suggested Citation

  • Robson Flavio Castro & Moacir Godinho-Filho & Roberto Fernandes Tavares-Neto, 2022. "Dispatching method based on particle swarm optimization for make-to-availability," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 1021-1030, April.
    • Handle: RePEc:spr:joinma:v:33:y:2022:i:4:d:10.1007_s10845-020-01707-6
    DOI: 10.1007/s10845-020-01707-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01707-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-020-01707-6?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.

    References listed on IDEAS

    as
    1. Hao Liu & Yue Wang & Liangping Tu & Guiyan Ding & Yuhan Hu, 2019. "A modified particle swarm optimization for large-scale numerical optimizations and engineering design problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2407-2433, August.
    2. Heng Zhang & Utpal Roy, 2019. "A semantics-based dispatching rule selection approach for job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2759-2779, October.
    3. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    4. Maroua Nouiri & Abdelghani Bekrar & Abderezak Jemai & Smail Niar & Ahmed Chiheb Ammari, 2018. "An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 603-615, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    2. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    3. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    4. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    5. Almeder, Christian, 2010. "A hybrid optimization approach for multi-level capacitated lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 200(2), pages 599-606, January.
    6. Fei Luan & Zongyan Cai & Shuqiang Wu & Shi Qiang Liu & Yixin He, 2019. "Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    7. Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
    8. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    9. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    10. Sanja Petrovic & Carole Fayad & Dobrila Petrovic & Edmund Burke & Graham Kendall, 2008. "Fuzzy job shop scheduling with lot-sizing," Annals of Operations Research, Springer, vol. 159(1), pages 275-292, March.
    11. Bredstrom, David & Lundgren, Jan T. & Ronnqvist, Mikael & Carlsson, Dick & Mason, Andrew, 2004. "Supply chain optimization in the pulp mill industry--IP models, column generation and novel constraint branches," European Journal of Operational Research, Elsevier, vol. 156(1), pages 2-22, July.
    12. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    13. van Norden, Linda & van de Velde, Steef, 2005. "Multi-product lot-sizing with a transportation capacity reservation contract," European Journal of Operational Research, Elsevier, vol. 165(1), pages 127-138, August.
    14. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    15. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
    16. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    17. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    18. Ferreira, Deisemara & Clark, Alistair R. & Almada-Lobo, Bernardo & Morabito, Reinaldo, 2012. "Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production," International Journal of Production Economics, Elsevier, vol. 136(2), pages 255-265.
    19. Carvalho, Desiree M. & Nascimento, Mariá C.V., 2022. "Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup," European Journal of Operational Research, Elsevier, vol. 296(1), pages 158-173.
    20. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.

    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:joinma:v:33:y:2022:i:4:d:10.1007_s10845-020-01707-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.