IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2022y2022i1n1253336.html

Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint

Author

Listed:
  • Meysam Kazemi Esfeh
  • Amir Abbas Shojaie
  • Hasan Javanshir
  • Kaveh Khalili-Damghani

Abstract

In this study, a new mathematical model is presented to solve the flexible flow shop problem where transportation is reliable and there are constraints on intermediate buffers, budgets, and human resource learning effects. Firstly, the model is validated to confirm the accuracy of its performance. Then, since it is an NP‐hard one, two metaheuristic algorithms, namely, MOSA and MOEA/D, are rendered to solve mid‐ and large‐scale problems. To confirm their accuracy of performance, two small‐scale problems are solved using GAMS exact solution software, and the obtained results have been compared with the output of the algorithms. Since the problem in this study is multiobjective, five comparative indices are used to compare the performance of algorithms. The results show that the answers achieved using the metaheuristic algorithms are very close to the ones achieved via the GAMS exact program. Therefore, the proposed algorithms are validated, and it is proved that they are accurately designed and useable in solving the real‐world problems (which have mid‐ and large‐scale) in logical calculation time. By comparing the obtained results, it can be seen that the MOEA/D algorithm performs better in terms of computational time (CPU time) and Mean ideal distance (MID). The MOSA algorithm also performs better according to the index Spread of nondominated solutions (SNS), diversity metric (DM), and number of Pareto solutions (NPS). Considering the confirmation of precision and accuracy of performance of the proposed algorithms, it can be concluded that MOSA and MOEA/D are useful in solving the mid‐ and large‐scale modes of the problem in the study, which is very applicable in the real world.

Suggested Citation

  • Meysam Kazemi Esfeh & Amir Abbas Shojaie & Hasan Javanshir & Kaveh Khalili-Damghani, 2022. "Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint," Complexity, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:1253336
    DOI: 10.1155/2022/1253336
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/1253336
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/1253336?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
    ---><---

    References listed on IDEAS

    as
    1. Pagnozzi, Federico & Stützle, Thomas, 2021. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints," Operations Research Perspectives, Elsevier, vol. 8(C).
    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. Helena Ramalhinho & Thomas Stützle, 2025. "Iterated local search, iterated greedy and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(2), pages 229-261, July.
    2. Chen-Yang Cheng & Shih-Wei Lin & Pourya Pourhejazy & Kuo-Ching Ying & Yu-Zhe Lin, 2021. "No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework," Mathematics, MDPI, vol. 9(12), pages 1-18, June.
    3. Martín-Santamaría, Raúl & López-Ibáñez, Manuel & Stützle, Thomas & Colmenar, J. Manuel, 2024. "On the automatic generation of metaheuristic algorithms for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 318(3), pages 740-751.

    More about this item

    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:wly:complx:v:2022:y:2022:i:1:n:1253336. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

    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.