Aqil, S., & Allali, K. (2021). Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem. Engineering Applications of Artificial Intelligence, 100, 104196.
Ebrahimi, M., Ghomi, S. F., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Applied mathematical modelling, 38(9-10), 2490-2504.
Elmi, A., & Topaloglu, S. (2013). A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Computers & operations research, 40(10), 2543-2555.
Hakimzadeh Abyaneh, S., & Zandieh, M. (2012). Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. The International Journal of Advanced Manufacturing Technology, 58, 309-325.
Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations research, 44(3), 510-525.
Işık, E. E., Topaloglu Yildiz, S., & Şatır Akpunar, Ö. (2023). Constraint programming models for the hybrid flow shop scheduling problem and its extensions. Soft Computing, 27(24), 18623-18650.
Kendall, M. (1938). A new measure of rank correlation, Biometrika, 30, (1–2), 81–89. https://doi.org/10.1093/biomet/30.1-2.81.
Khamseh, A., Jolai, F., & Babaei, M. (2015). Integrating sequence-dependent group scheduling problem and preventive maintenance in flexible flow shops. The International Journal of Advanced Manufacturing Technology, 77, 173-185.
Li, J. Q., & Pan, Q. K. (2015). Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Information Sciences, 316, 487-502.
Liu, F., Li, G., Lu, C., Yin, L., & Zhou, J. (2024). A tri-individual iterated greedy algorithm for the distributed hybrid flow shop with blocking. Expert Systems with Applications, 237, 121667.
Maciel, I., Prata, B., Nagano, M., & Abreu, L. (2022). A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times. Journal of Project Management, 7(4), 201-216.
Miyata, H. H., & Nagano, M. S. (2019). The blocking flow shop scheduling problem: A comprehensive and conceptual review. Expert Systems with Applications, 137, 130-156.
Moccellin, J. V., Nagano, M. S., Pitombeira Neto, A. R., & de Athayde Prata, B. (2018). Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 40, 1-11.
Naderi, B., Zandieh, M., & Aminnayeri, M. (2011). Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Applied Soft Computing, 11(2), 2094-2101.
Pessoa, R., Maciel, I., Moccellin, J., Pitombeira-Neto, A., & Prata, B. (2021). Hybrid flow shop scheduling problem with machine blocking, setup times and unrelated parallel machines per stage. Investigacion Operacional.
Qin, H. X., Han, Y. Y., Zhang, B., Meng, L. L., Liu, Y. P., Pan, Q. K., & Gong, D. W. (2022). An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem. Swarm and Evolutionary Computation, 69, 100992.
Rashidi, E., Jahandar, M., & Zandieh, M. (2010). An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. The International Journal of Advanced Manufacturing Technology, 49, 1129-1139.
Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European journal of operational research, 169(3), 781-800.
Salvador, M. S. (1973, January). A solution to a special case of flow shop scheduling problems. In Symposium on the theory of scheduling and its applications (pp. 83-91). Berlin: Springer.
Salvietti, L., Smith, N R. and Cárdenas-Barrón, L.E. (2014). A stochastic profit maximising economic lot scheduling problem with price optimisation. European Journal of Industrial Engineering, 8 (2), 193–221.
Shao, Z., Shao, W., Chen, J., & Pi, D. (2024). A feedback learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling problem with flexible assembly and setup time. Engineering Applications of Artificial Intelligence, 131, 107818.
Tao, Z., Liu, X., & Zeng, P. (2014). Study on hybrid flow shop scheduling problem with blocking based on GASA. The Open Automation and Control Systems Journal, 6(1).
Tosun, Ö., Marichelvam, M. K., & Tosun, N. (2020). A literature review on hybrid flow shop scheduling. International Journal of Advanced Operations Management, 12(2), 156-194.
Vallada, E., Ruiz, R., & Minella, G. (2008). Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4), 1350-1373.
Wang, Y., Wang, Y., & Han, Y. (2023). A variant iterated greedy algorithm integrating multiple decoding rules for hybrid blocking flow shop scheduling problem. Mathematics, 11(11), 2453.
Yuan, K., Sauer, N., & Sauvey, C. (2009, September). Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking. In 2009 IEEE Conference on Emerging Technologies & Factory Automation (pp. 1-7). IEEE.
Zheng, Q., Zhang, Y., Tian, H., & He, L. (2024). A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers. Complex & Intelligent Systems, 10(1), 781-809.