IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i14p2288-d1440298.html
   My bibliography  Save this article

A Multi-Objective Non-Dominated Sorting Gravitational Search Algorithm for Assembly Flow-Shop Scheduling of Marine Prefabricated Cabins

Author

Listed:
  • Ruipu Dong

    (College of Shipbuilding Engineering, Harbin Engineering University, Harbin 150001, China)

  • Jinghua Li

    (College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin 150001, China)

  • Dening Song

    (College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin 150001, China)

  • Boxin Yang

    (College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin 150001, China)

  • Lei Zhou

    (College of Mechanical and Electrical Engineering, Harbin Engineering University, Harbin 150001, China)

Abstract

Prefabricated cabin modular units (PMCUs) are a widespread type of intermediate products used during ship or offshore platform construction. This paper focuses on the scheduling problem of PMCU assembly flow shops, which is summarized as a multi-objective, fuzzy-blocking hybrid flow-shop-scheduling problem based on learning and fatigue effects (FB-HFSP-LF) to minimize the maximum fuzzy makespan and maximize the average fuzzy due-date agreement index. This paper proposes a multi-objective non-dominated sorting gravitational search algorithm (MONSGSA) to solve it. In the proposed MONSGSA, the ranked-order value is used to convert continuous solutions to discrete solutions. Multi-dimensional Latin hypercube sampling is used to enhance initial population diversity. Setting up an external archive to maintain non-dominated solutions while introducing an adaptive inertia factor and a trap avoidance operator to guide individual positional updates. The results of multiple sets of experiments show that Pareto solutions of MONSGSA have better distribution and convergence compared to other competitors. Finally, the instance of PMCU manufacturer is used for validation, and the results show that MONSGSA has better applicability to practical problems.

Suggested Citation

  • Ruipu Dong & Jinghua Li & Dening Song & Boxin Yang & Lei Zhou, 2024. "A Multi-Objective Non-Dominated Sorting Gravitational Search Algorithm for Assembly Flow-Shop Scheduling of Marine Prefabricated Cabins," Mathematics, MDPI, vol. 12(14), pages 1-32, July.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:14:p:2288-:d:1440298
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/14/2288/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/14/2288/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kai Li & Shuling Xu & Hong Fu, 2020. "Work-break scheduling with real-time fatigue effect and recovery," International Journal of Production Research, Taylor & Francis Journals, vol. 58(3), pages 689-702, February.
    2. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    3. Baruch Mor & Gur Mosheiov & Dana Shapira, 2020. "Flowshop scheduling with learning effect and job rejection," Journal of Scheduling, Springer, vol. 23(6), pages 631-641, December.
    4. Sakawa, Masatoshi & Kubota, Ryo, 2000. "Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms," European Journal of Operational Research, Elsevier, vol. 120(2), pages 393-407, January.
    5. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    6. Wang, Ting & Baldacci, Roberto & Lim, Andrew & Hu, Qian, 2018. "A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine," European Journal of Operational Research, Elsevier, vol. 271(3), pages 826-838.
    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. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    2. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    3. Lingfa Lu & Liqi Zhang, 2023. "Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-17, August.
    4. Jiang, Junwei & An, Youjun & Dong, Yuanfa & Hu, Jiawen & Li, Yinghe & Zhao, Ziye, 2023. "Integrated optimization of non-permutation flow shop scheduling and maintenance planning with variable processing speed," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    5. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    6. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    7. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    8. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    9. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    10. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    11. Jeunet, Jully & Salassa, Fabio, 2024. "Optimised break scheduling vs. rest breaks in collective agreements under fatigue and non preemption," International Journal of Production Economics, Elsevier, vol. 275(C).
    12. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    13. 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.
    14. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    15. Billaut, Jean-Charles & Della Croce, Federico & Grosso, Andrea, 2015. "A single machine scheduling problem with two-dimensional vector packing constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 75-81.
    16. K A H Kobbacy & S Vadera & M H Rasmy, 2007. "AI and OR in management of operations: history and trends," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 10-28, January.
    17. Weiwei Wang & Biao Zhang & Baoxian Jia, 2023. "A Multiobjective Optimization Approach for Multiobjective Hybrid Flowshop Green Scheduling with Consistent Sublots," Sustainability, MDPI, vol. 15(3), pages 1-29, February.
    18. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    19. S. M. Mousavi & I. Mahdavi & J. Rezaeian & M. Zandieh, 2018. "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times," Operational Research, Springer, vol. 18(1), pages 123-158, April.
    20. Luda Zhao & Bin Wang & Congyong Shen, 2021. "A multi-objective scheduling method for operational coordination time using improved triangular fuzzy number representation," PLOS ONE, Public Library of Science, vol. 16(6), pages 1-31, June.

    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:gam:jmathe:v:12:y:2024:i:14:p:2288-:d:1440298. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.