Allahverdi, A., & Allahverdi, M. (2018). Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness. Computational and Applied Mathematics, 37(5), 6774-6794.
Allahverdi, A., & Al-Anzi, F. S. (2006). A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. European Journal of Operational Research, 169(3), 767-780.
Allahverdi, A., Aydilek, H., & Aydilek, A. (2022). An algorithm for a no-wait flowshop scheduling problem for mini-mizing total tardiness with a constraint on total completion time. International Journal of Industrial Engineering Computations, 13(1), 43-50.
Baskar, A., & Xavior, A. (2012). A Simple Model to Optimize General Flow Shop Scheduling Problems with Known Break down Time and Weights of Jobs. Procedia Engineering, 38(1), 191-196.
Baskar, A., & Xavior, M. A. (2014). Optimization of makespan in job and machine priority environment. Procedia En-gineering, 97, 22-28.
Bożejko, W., Smutnicki, C., Uchroński, M., & Wodecki, M. (2020). Cyclic Two Machine Flow Shop with Disjoint Se-quence-Dependent Setups. In Modelling and Performance Analysis of Cyclic Systems (pp. 31-47). Springer, Cham.
Cheng, S. R., Yin, Y., Wen, C. H., Lin, W. C., Wu, C. C., & Liu, J. (2017). A two-machine flowshop scheduling problem with precedence constraint on two jobs. Soft Computing, 21(8), 2091-2103.
Fernandez-Viagas, V., & Framinan, J. M. (2014). On insertion tie-breaking rules in heuristics for the permutation flow-shop scheduling problem. Computers & Operations Research, 45, 60-67.
Framinan, J. M., Leisten, R., & Rajendran, C. (2003). Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Interna-tional Journal of Production Research, 41(1), 121-148.
Gao, J., & Chen, R. (2011). A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem." International Journal of Computational Intelligence Systems, 4(4), 497-508.
Gladky, A. A., Shafransky, Y. M., & Strusevich, V. A. (2004). Flow shop scheduling problems under machine–dependent precedence constraints. Journal of combinatorial optimization, 8(1), 13-28.
Hatami, S., Ruiz, R., & Andrés-Romano, C. (2015). Heuristics and metaheuristics for the distributed assembly permuta-tion flowshop scheduling problem with sequence dependent setup times. International Journal of Production Eco-nomics, 169, 76-88.
Janaki, E., & Mohamed Ismail, A. (2020). Flow Shop Scheduling in Which Processing Time Connected with Probabili-ties and Job Delay Due to Maintenance for M* N Machine. In Information and Communication Technology for Sus-tainable Development (pp. 651-657). Springer, Singapore.
Johnson, S. M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval research lo-gistics quarterly, 1(1), 61-68.
Jolai, F., Rabiee, M., & Asefi, H. (2012). A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. International Journal of Production Research, 50(24), 7447-7466.
Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research, 35(9), 3001-3008.
Lee, J. Y., & Kim, Y. D. (2017). Minimizing total tardiness in a two-machine flowshop scheduling problem with availa-bility constraint on the first machine. Computers & Industrial Engineering, 114, 22-30.
Li, W., Nault, B. R., & Ye, H. (2019). Trade-off balancing in scheduling for flow shop production and perioperative pro-cesses. European Journal of Operational Research, 273(3), 817-830.
Liang, Z., Zhong, P., Liu, M., Zhang, C., & Zhang, Z. (2022). A computational efficient optimization of flow shop scheduling problems. Scientific Reports, 12(1), 1-16.
Lin, S. W., & Ying, K. C. (2016). Minimizing makespan for solving the distributed no-wait flowshop scheduling prob-lem. Computers & Industrial Engineering, 99, 202-209.
Marichelvam, M. K., Tosun, Ö., & Geetha, M. (2017). Hybrid monkey search algorithm for flow shop scheduling prob-lem under makespan and total flow time. Applied Soft Computing, 55, 82-92.
Ren, T., Wang, X., Liu, T., Wu, C. C., Bai, D., Lin, L., & Guo, M. (2021). Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates. Engineering Optimization, 1-17.
Ruiz, R., García-Díaz, J. C., & Maroto, C. (2007). Considering scheduling and preventive maintenance in the flowshop sequencing problem. Computers & Operations Research, 34(11), 3314-3330.
Salido, M. A., Escamilla, J., Giret, A., & Barber, F. (2016). A genetic algorithm for energy-efficiency in job-shop scheduling. The International Journal of Advanced Manufacturing Technology, 85(5), 1303-1314.
Semančo, P., & Modrák, V. (2011, October). Hybrid GA-based improvement heuristic with makespan criterion for flow-shop scheduling problems. In International Conference on ENTERprise Information Systems (pp. 11-18). Springer, Berlin, Heidelberg.
Shao, W., Pi, D., & Shao, Z. (2017). Optimization of makespan for the distributed no-wait flow shop scheduling prob-lem with iterated greedy algorithms. Knowledge-Based Systems, 137, 163-181.
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European journal of Op-erational research, 47(1), 65-74.
Thangaraj, M., Kumar, T., & Nandan, K. (2022). A precedence constrained flow shop scheduling problem with transpor-tation time, breakdown times, and weighted jobs. Journal of Project Management, 7(4), 229-240.
Wang, H., Huang, M., & Wang, J. (2019). An effective metaheuristic algorithm for flowshop scheduling with deteriorat-ing jobs. Journal of Intelligent Manufacturing, 30(7), 2733-2742.
Ye, H., Wang, X., & Liu, K. (2020). Adaptive preventive maintenance for flow shop scheduling with resumable pro-cessing. IEEE Transactions on Automation Science and Engineering, 18(1), 106-113.