IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v24y2024i2d10.1007_s12351-024-00829-6.html
   My bibliography  Save this article

A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints

Author

Listed:
  • Jianfu Chen

    (Hefei University of Technology
    Université Gustave-Eiffel)

  • Kai Li

    (Hefei University of Technology
    Ministry of Education)

  • Chengbin Chu

    (Université Gustave-Eiffel)

  • Abderrahim Sahli

    (Université Gustave-Eiffel)

Abstract

This article studies a uniform parallel machine scheduling problem with unequal job release times. It is assumed that each machine consumes a certain non-renewable resource when manufacturing jobs. The objective is to find an optimal schedule to minimize the makespan, given that the total resource consumption does not exceed the given limit. A mathematical model is first built to derive optimal solutions for small-scale instances. For large-scale instances, a simplified swarm optimization (SSO) algorithm is proposed. Considering that the parameters of meta-heuristic algorithms have great impacts on the output solution, the Taguchi method is then applied to tune the algorithm parameters. Afterward, a large number of simulation experiments are conducted. Finally, Friedman’s test and Wilcoxon signed-rank test are employed to analyze the simulation results from statistical perspectives. Experimental results reveal that the proposed algorithm can provide competitive solutions.

Suggested Citation

  • Jianfu Chen & Kai Li & Chengbin Chu & Abderrahim Sahli, 2024. "A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints," Operational Research, Springer, vol. 24(2), pages 1-27, June.
    • Handle: RePEc:spr:operea:v:24:y:2024:i:2:d:10.1007_s12351-024-00829-6
    DOI: 10.1007/s12351-024-00829-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00829-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/s12351-024-00829-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. Zhang, Haowei & Xie, Junwei & Ge, Jiaang & Zhang, Zhaojian & Zong, Binfeng, 2019. "A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar," European Journal of Operational Research, Elsevier, vol. 272(3), pages 868-878.
    2. Ozdamar, Linet & Ulusoy, Gunduz, 1994. "A local constraint based analysis approach to project scheduling under general resource constraints," European Journal of Operational Research, Elsevier, vol. 79(2), pages 287-298, December.
    3. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    4. Yang-Kuei Lin, 2013. "Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-9, February.
    5. Lancia, Giuseppe, 2000. "Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 120(2), pages 277-288, January.
    6. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    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. Mojtaba Afzalirad & Masoud Shafipour, 2018. "Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 423-437, February.
    2. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    3. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    4. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    5. Jun-Ho Lee & Hyun-Jung Kim, 2021. "A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 992-1026, December.
    6. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    7. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    8. Lova, Antonio & Tormos, Pilar & Cervantes, Mariamar & Barber, Federico, 2009. "An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes," International Journal of Production Economics, Elsevier, vol. 117(2), pages 302-316, February.
    9. Zhi Pei & Mingzhong Wan & Ziteng Wang, 2020. "A new approximation algorithm for unrelated parallel machine scheduling with release dates," Annals of Operations Research, Springer, vol. 285(1), pages 397-425, February.
    10. Boccia, Maurizio & Masone, Adriano & Sterle, Claudio & Murino, Teresa, 2023. "The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach," European Journal of Operational Research, Elsevier, vol. 307(2), pages 590-603.
    11. V. Van Peteghem & M. Vanhoucke, 2009. "Using Resource Scarceness Characteristics to Solve the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/595, Ghent University, Faculty of Economics and Business Administration.
    12. V. Van Peteghem & M. Vanhoucke, 2008. "A Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/494, Ghent University, Faculty of Economics and Business Administration.
    13. Bentao Su & Naiming Xie & Yingjie Yang, 2021. "Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 957-969, April.
    14. Xiue Gao & Wenxue Xie & Zumin Wang & Tianshu Zhang & Bo Chen & Ping Wang, 2020. "Predicting human body composition using a modified adaptive genetic algorithm with a novel selection operator," PLOS ONE, Public Library of Science, vol. 15(7), pages 1-23, July.
    15. Turan, Hasan Hüseyin & Jalalvand, Fatemeh & Elsawah, Sondoss & Ryan, Michael J., 2022. "A joint problem of strategic workforce planning and fleet renewal: With an application in defense," European Journal of Operational Research, Elsevier, vol. 296(2), pages 615-634.
    16. Jing Liu & Qiqi Zhi & Haipeng Ji & Bolong Li & Siyuan Lei, 2021. "Wheel hub customization with an interactive artificial immune algorithm," Journal of Intelligent Manufacturing, Springer, vol. 32(5), pages 1305-1322, June.
    17. Chen, Jianfu & Chu, Chengbin & Sahli, Abderrahim & Li, Kai, 2024. "A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs," European Journal of Operational Research, Elsevier, vol. 316(3), pages 856-872.
    18. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    19. Huang, Yuming & Ge, Bingfeng & Hipel, Keith W. & Fang, Liping & Zhao, Bin & Yang, Kewei, 2023. "Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm," European Journal of Operational Research, Elsevier, vol. 305(2), pages 806-819.
    20. Kolisch, Rainer & Hartmann, Sönke, 1998. "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 469, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:operea:v:24:y:2024:i:2:d:10.1007_s12351-024-00829-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.