IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v32y2024i2d10.1007_s11750-023-00662-8.html
   My bibliography  Save this article

Heuristics for flow shop rescheduling with mixed blocking constraints

Author

Listed:
  • Ayoub Tighazoui

    (Université de Strasbourg, ICUBE Laboratory, CNRS 7357)

  • Christophe Sauvey

    (Université de Lorraine, LGIPM)

  • Nathalie Sauer

    (Université de Lorraine, LGIPM)

Abstract

In the flow shop rescheduling literature, many papers consider unlimited buffer capacities between successive machines. In real fact, these capacities may be limited, or no store may exist. Thus, a blocking situation is inducted. Diverse types of blocking constraints are studied in the flow shop scheduling problems. However, in dynamic environments, only few papers deal with these kinds of constraints. The aim of this paper is to investigate a problem of rescheduling the jobs in a flowshop environment and mixed blocking as a constraint, considering simultaneously schedule efficiency and stability as a performance measure, and job arrival as a disruption. An iterative methodology based on the predictive–reactive strategy is implemented for dealing with this rescheduling problem. The problem has first been modeled as a Mixed Integer Linear Programing (MILP) model. Experimental results show that the MILP resolution is only possible for small-sized instances. Hence, inspired by NEH algorithm, we proposed four heuristics for solving large-sized instances of this problem. Eventually, we discussed the performance of the proposed heuristics for different blocking situations, both in terms of solution efficiency and resolution time.

Suggested Citation

  • Ayoub Tighazoui & Christophe Sauvey & Nathalie Sauer, 2024. "Heuristics for flow shop rescheduling with mixed blocking constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(2), pages 169-201, July.
    • Handle: RePEc:spr:topjnl:v:32:y:2024:i:2:d:10.1007_s11750-023-00662-8
    DOI: 10.1007/s11750-023-00662-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-023-00662-8
    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/s11750-023-00662-8?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. Ansis Ozolins, 2021. "Dynamic programming approach for solving the open shop problem," 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(1), pages 291-306, March.
    2. Ercan Şenyiğit & Uğur Atici & Mehmet Burak Şenol, 2022. "Effects of OCRA parameters and learning rate on machine scheduling," 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. 30(3), pages 941-959, September.
    3. Jonathan De La Vega & Alfredo Moreno & Reinaldo Morabito & Pedro Munari, 2023. "A robust optimization approach for the unrelated parallel machine scheduling problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 31-66, April.
    4. Pablo Valledor & Alberto Gomez & Javier Puente & Isabel Fernandez, 2022. "Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments with Multiple Objectives Using the Hybrid Dynamic Non-Dominated Sorting Genetic II Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-20, July.
    5. Wajdi Trabelsi & Christophe Sauvey & Nathalie Sauer, 2012. "Heuristics and metaheuristics for solving mixed blocking constraints flowshop scheduling problems," Post-Print hal-01515219, HAL.
    6. Lodree, Emmett & Jang, Wooseung & Klein, Cerry M., 2004. "A new rule for minimizing the number of tardy jobs in dynamic flow shops," European Journal of Operational Research, Elsevier, vol. 159(1), pages 258-263, November.
    7. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," 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. 28(1), pages 5-23, March.
    8. Emine Akyol Ozer & Tugba Sarac, 2019. "MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 94-124, April.
    9. Bruno de Athayde Prata & Levi Ribeiro Abreu & José Ytalo Ferreira Lima, 2021. "Heuristic methods for the single-machine scheduling problem with periodical resource constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 524-546, July.
    10. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    11. Martinez, S. & Dauzere-Peres, S. & Gueret, C. & Mati, Y. & Sauer, N., 2006. "Complexity of flowshop scheduling problems with a new blocking constraint," European Journal of Operational Research, Elsevier, vol. 169(3), pages 855-864, March.
    12. Anselmo Ramalho Pitombeira-Neto & Bruno de Athayde Prata, 2020. "A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 178-192, April.
    13. Iracyanne Retto Uhlmann & Renata Mariani Zanella & Enzo Morosini Frazzon, 2022. "Hybrid flow shop rescheduling for contract manufacturing services," International Journal of Production Research, Taylor & Francis Journals, vol. 60(3), pages 1069-1085, February.
    14. Josefa Mula & Marija Bogataj, 2021. "OR in the industrial engineering of Industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR," 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 1163-1184, December.
    15. Roland Braune & Walter J. Gutjahr & Petra Vogl, 2022. "Stochastic radiotherapy appointment scheduling," 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. 30(4), pages 1239-1277, December.
    16. Jeffrey W. Herrmann, 2006. "Rescheduling Strategies, Policies, and Methods," International Series in Operations Research & Management Science, in: Jeffrey W. Herrmann (ed.), Handbook of Production Scheduling, chapter 0, pages 135-148, Springer.
    17. Peter Auer & György Dósa & Tibor Dulai & Armin Fügenschuh & Peggy Näser & Ronald Ortner & Ágnes Werner-Stark, 2021. "A new heuristic and an exact approach for a production planning problem," 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(3), pages 1079-1113, September.
    18. Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
    19. Sayed Ibrahim Sayed & Ivan Contreras & Juan A. Diaz & Dolores E. Luna, 2020. "Integrated cross-dock door assignment and truck scheduling with handling times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 705-727, October.
    20. Christophe Sauvey & Wajdi Trabelsi & Nathalie Sauer, 2020. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems," Mathematics, MDPI, vol. 8(1), pages 1-17, 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. Said Aqil & Karam Allali, 2021. "On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time," Annals of Operations Research, Springer, vol. 296(1), pages 615-637, January.
    2. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
    3. Marcelo Seido Nagano & Adriano Seiko Komesu & Hugo Hissashi Miyata, 2019. "An evolutionary clustering search for the total tardiness blocking flow shop problem," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1843-1857, April.
    4. Li, Chung-Lun & Li, Feng, 2020. "Rescheduling production and outbound deliveries when transportation service is disrupted," European Journal of Operational Research, Elsevier, vol. 286(1), pages 138-148.
    5. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
    6. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2008. "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop," International Journal of Production Economics, Elsevier, vol. 113(2), pages 819-833, June.
    7. Ribas, Imma & Companys, Ramon & Tort-Martorell, Xavier, 2011. "An iterated greedy algorithm for the flowshop scheduling problem with blocking," Omega, Elsevier, vol. 39(3), pages 293-301, June.
    8. Weibo Liu & Yan Jin & Mark Price, 2017. "New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3234-3248, June.
    9. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    10. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    11. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    12. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    13. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    14. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    15. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    16. Yu-Jun Zheng & Yi-Chen Du & Wei-Guo Sheng & Hai-Feng Ling, 2019. "Collaborative Human–UAV Search and Rescue for Missing Tourists in Nature Reserves," Interfaces, INFORMS, vol. 49(5), pages 371-383, September.
    17. 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.
    18. 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.
    19. Guanghua Wu & Hongli Zhu, 2024. "Single-Machine Rescheduling with Rejection and an Operator No-Availability Period," Mathematics, MDPI, vol. 12(23), pages 1-11, November.
    20. Ghorbanzadeh, Masoumeh & Ranjbar, Mohammad, 2023. "Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints," European Journal of Operational Research, Elsevier, vol. 307(2), pages 519-537.

    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:topjnl:v:32:y:2024:i:2:d:10.1007_s11750-023-00662-8. 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.