Bellman, R. (1956). Mathematical aspects of scheduling theory. Journal of the Society for Industrial and Applied Math-ematics, 4(3), 168-205.
Branda, A., Castellano, D., Guizzi, G., & Popolo, V. (2021). Metaheuristics for the flow shop-scheduling problem with maintenance activities integrated. Computers & Industrial Engineering, 151, 106989.
Chandramouli, A. B. (2005). Heuristic Approach For N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time And Weights Of Jobs. Mathematical and Computational Applications, 10(2), 301-305.
Chou, F. D., & Lee, C. E. (1999). Two-machine flowshop scheduling with bicriteria problem. Computers & Industrial Engineering, 36(3), 549-564.
Fabri, M., Ramalhinho, H., de Souza, M. C., & Ravetti, M. G. (2019). The lagrangean relaxation for the flow shop scheduling problem with precedence constraints, release dates and delivery times. Journal of Advanced Transporta-tion, 2019.
Fazel Zarandi, M. H., Sadat Asl, A. A., Sotudian, S., & Castillo, O. (2020). A state of the art review of intelligent sched-uling. Artificial Intelligence Review, 53(1), 501-593.
Gupta, D., Singla, P., & Bala, S. (2013). Two stage flow shop scheduling problem including transportation time and weightage of jobs with branch and bound method. International Journal of Applied Operational Research-An Open Access Journal, 3(4), 1-6.
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.
Khodadadi, A. (2011). Solving constrained flow-shop scheduling problem with three machines. International Journal of Academic Research, 3(1), 38-40.
Maggu, P. L., & Das, G. (1980). On 2× n sequencing problem with transportation times of jobs. Pure and Applied Math-ematika Sciences, 12(1), 6.
Miyazaki, S., & Nishiyama, N. (1980). Analysis for minimizing weighted mean flow-time in flow-shop scheduling. Journal of the Operations Research Society of Japan, 23(2), 118-133.
Maggu, P.L., Yadav, S. K., Singh, T. P., & Dev, A. (1984). Flow-shop scheduling problem involving job-weight and transportation time. Pure and Applied Mathematica Sciences, 20.
Pandian, P., & Rajendran, P. (2010). Solving constrained flow-shop scheduling problems with three machines. Int. J. Contemp. Math. Sciences, 5(19), 921-929.
Pinedo, M., & Hadavi, K. (1992). Scheduling: theory, algorithms and systems development. In Operations research proceedings 1991 (pp. 35-42). Springer, Berlin, Heidelberg.
Rajendran, C., & Ziegler, H. (1997). An efficient heuristic for scheduling in a flowshop to minimize total weighted flow time of jobs. European Journal of Operational Research, 103(1), 129-138.
Ren, T., Guo, M., Lin, L., & Miao, Y. (2015). A local search algorithm for the flow shop scheduling problem with re-lease dates. Discrete Dynamics in Nature and Society, 2015.
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.
Thangaraj, M., & Rajendran, P. (2016). Solving constrained multi-stage machines flow-shop scheduling problems in fuzzy environment. International Journal of Applied Engineering Research, 11(1), 521-528.