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

A Novel Pareto-Optimal Algorithm for Flow Shop Scheduling Problem

Author

Listed:
  • Nasser Shahsavari-Pour

    (Department of Industrial Engineering, Vali-e-Asr University of Rafsanjan, Rafsanjan 7718897111, Iran)

  • Azim Heydari

    (Department of Astronautics, Electrical and Energetic Engineering (DIAEE) Sapienza University, 00184 Rome, Italy
    Department of Energy Management and Optimization, Institute of Science and High Technology and Environmental Sciences, Graduate University of Advanced Technology, Kerman 7631885356, Iran)

  • Afef Fekih

    (Department of Electrical and Computer Engineering, University of Louisiana at Lafayette, Lafayette, LA 70504, USA)

  • Hamed Asadi

    (Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran 1477893855, Iran)

Abstract

Minimizing job waiting time for completing related operations is a critical objective in industries such as chemical and food production, where efficient planning and production scheduling are paramount. Addressing the complex nature of flow shop scheduling problems, which pose significant challenges in the manufacturing process due to the vast solution space, this research employs a novel multiobjective genetic algorithm called distance from ideal point in genetic algorithm (DIPGA) to identify Pareto-optimal solutions. The effectiveness of the proposed algorithm is benchmarked against other powerful methods, namely, NSGA, MOGA, NSGA-II, WBGA, PAES, GWO, PSO, and ACO, using analysis of variance (ANOVA). The results demonstrate that the new approach significantly improves decision-making by evaluating a broader range of solutions, offering faster convergence and higher efficiency for large-scale scheduling problems with numerous jobs. This innovative method provides a comprehensive listing of Pareto-optimal solutions for minimizing makespan and total waiting time, showcasing its superiority in addressing highly complex problems.

Suggested Citation

  • Nasser Shahsavari-Pour & Azim Heydari & Afef Fekih & Hamed Asadi, 2024. "A Novel Pareto-Optimal Algorithm for Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 12(18), pages 1-15, September.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2951-:d:1483448
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Thornton, Henry W. & Hunsucker, John L., 2004. "A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage," European Journal of Operational Research, Elsevier, vol. 152(1), pages 96-114, January.
    2. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    3. Zhengyu Hu & Wenrui Liu & Shengchen Ling & Kuan Fan, 2021. "Research on multi-objective optimal scheduling considering the balance of labor workload distribution," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-15, August.
    4. Fink, Andreas & Vo[ss], Stefan, 2003. "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, Elsevier, vol. 151(2), pages 400-414, December.
    5. Sarker, Ruhul & Liang, Ko-Hsin & Newton, Charles, 2002. "A new multiobjective evolutionary algorithm," European Journal of Operational Research, Elsevier, vol. 140(1), pages 12-23, July.
    6. Andres, Carlos & Albarracin, Jose Miguel & Tormo, Guillermina & Vicens, Eduardo & Garcia-Sabater, Jose Pedro, 2005. "Group technology in a hybrid flowshop environment: A case study," European Journal of Operational Research, Elsevier, vol. 167(1), pages 272-281, November.
    7. Tamiz, Mehrdad & Jones, Dylan & Romero, Carlos, 1998. "Goal programming for decision making: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 111(3), pages 569-581, December.
    8. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    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. Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
    2. Shyamal Gondkar & Sivakumar Sreeramagiri & Edwin Zondervan, 2012. "Methodology for Assessment and Optimization of Industrial Eco-Systems," Challenges, MDPI, vol. 3(1), pages 1-21, June.
    3. Konak, Abdullah & Coit, David W. & Smith, Alice E., 2006. "Multi-objective optimization using genetic algorithms: A tutorial," Reliability Engineering and System Safety, Elsevier, vol. 91(9), pages 992-1007.
    4. Liu, Shi Qiang & Kozan, Erhan, 2009. "Scheduling a flow shop with combined buffer conditions," International Journal of Production Economics, Elsevier, vol. 117(2), pages 371-380, February.
    5. Tan, K.C. & Goh, C.K. & Yang, Y.J. & Lee, T.H., 2006. "Evolving better population distribution and exploration in evolutionary multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 171(2), pages 463-495, June.
    6. 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.
    7. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    8. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    9. Vikrant Sharma & Sundeep Kumar & M. L. Meena, 2022. "Key criteria influencing cellular manufacturing system: a fuzzy AHP model," Journal of Business Economics, Springer, vol. 92(1), pages 65-84, January.
    10. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    11. Demirci, Mehmet & Bettinger, Pete, 2015. "Using mixed integer multi-objective goal programming for stand tending block designation: A case study from Turkey," Forest Policy and Economics, Elsevier, vol. 55(C), pages 28-36.
    12. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    13. Surafel Luleseged Tilahun & Mohamed A. Tawhid, 2019. "Swarm hyperheuristic framework," Journal of Heuristics, Springer, vol. 25(4), pages 809-836, October.
    14. T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero, 2011. "A multiobjective model for forest planning with adjacency constraints," Annals of Operations Research, Springer, vol. 190(1), pages 75-92, October.
    15. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    16. Aouni, Belaid & Kettani, Ossama, 2001. "Goal programming model: A glorious history and a promising future," European Journal of Operational Research, Elsevier, vol. 133(2), pages 225-231, January.
    17. Pérez-Mesa, Juan Carlos & Galdeano-Gómez, Emilio & Salinas Andújar, Jose A., 2012. "Logistics network and externalities for short sea transport: An analysis of horticultural exports from southeast Spain," Transport Policy, Elsevier, vol. 24(C), pages 188-198.
    18. Zilla Sinuany-Stern, 2014. "Quadratic model for allocating operational budget in public and nonprofit organizations," Annals of Operations Research, Springer, vol. 221(1), pages 357-376, October.
    19. Zgajnar, Jaka & Kavcic, Stane, 2011. "Weighted Goal Programming and Penalty Functions: Whole-farm Planning Approach Under Risk," 2011 International Congress, August 30-September 2, 2011, Zurich, Switzerland 118033, European Association of Agricultural Economists.
    20. Quan, Gang & Greenwood, Garrison W. & Liu, Donglin & Hu, Sharon, 2007. "Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1969-1984, March.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jmathe:v:12:y:2024:i:18:p:2951-:d:1483448. 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.