Aldowaisan, T., & Allahverdi, A. (2003). New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research, 30(8), 1219-1231.
Allahverdi, A., & Aldowaisan, T. (2004). No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, 152(1), 132-147.
Asadzadeh, L., & Zamanifar, K. (2010). An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52(11-12), 1957-1965.
Atashpaz-Gargari, E., & Lucas, C. (2007, September). Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In Evolutionary computation, 2007. CEC 2007. IEEE Congress on (pp. 4661-4667). IEEE.
Baker, K. R. (1974). Introduction to sequencing and scheduling, John Wiley and sons Inc. New York.
Bai, D., Tang, M., Zhang, Z. H., & Santibanez-Gonzalez, E. D. (2018). Flow shop learning effect scheduling problem with release dates. Omega, 78, 21-38.
Chen, X., Chau, V., Xie, P., Sterna, M., & Błażewicz, J. (2017). Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect. Computers & Industrial Engineering, 111, 176-182.
Chen, J. C., Wu, C. C., Chen, C. W., & Chen, K. H. (2012). Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm. Expert Systems with Applications, 39(11), 10016-10021.
Chen, J. S., Pan, J. C. H., & Lin, C. M. (2008). A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert systems with applications, 34(1), 570-577.
Choi, S. W., & Kim, Y. D. (2008). Minimizing makespan on an m-machine re-entrant flowshop. Computers & Operations Research, 35(5), 1684-1696.
Dempster, M. A. (Ed.). (2012). Deterministic and Stochastic Scheduling: Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems held in Durham, England, July 6–17, 1981 (Vol. 84). Springer Science & Business Media.
Engin, O., & Güçlü, A. (2018). A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing, 72, 166-176.
Eren, T., & Güner, E. (2008). A bicriteria flowshop scheduling with a learning effect. Applied Mathematical Modelling, 32(9), 1719-1733.
Gao, F., Liu, M., Wang, J. J., & Lu, Y. Y. (2018). No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times. International Journal of Production Research, 56(6), 2361-2369.
Goldbogen, J. A., Friedlaender, A. S., Calambokidis, J., McKenna, M. F., Simon, M., & Nowacek, D. P. (2013). Integrative approaches to the study of baleen whale diving behavior, feeding performance, and foraging ecology. BioScience, 63(2), 90-100.
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.
He, H. (2016). Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect. Computers & Industrial Engineering, 97, 73-83.
Kashan, A. H. (2014). League Championship Algorithm (LCA): An algorithm for global optimization inspired by sport championships. Applied Soft Computing, 16, 171-200.
Kashan, A. H., & Karimi, B. (2010, July). A new algorithm for constrained optimization inspired by the sport league championships. In Evolutionary Computation (CEC), 2010 IEEE Congress on (pp. 1-8). IEEE.
Laha, D., & Gupta, J. N. (2016). A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Computers & Industrial Engineering, 98, 373-383.
Li, X., Yang, Z., Ruiz, R., Chen, T., & Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences, 453, 408-425.
Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in Engineering Software, 95, 51-67.
Shahvari, O., & Logendran, R. (2018). A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. International Journal of Production Economics, 195, 227-248.
Shao, W., Pi, D., & Shao, Z. (2017). Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowledge-Based Systems, 137, 163-181.
Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., & Mirzaei, A. H. (2007). A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences, 177(22), 5072-5090.
Vahedi-Nouri, B., Fattahi, P., & Ramezanian, R. (2013). Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems, 32(1), 167-173.
Ye, H., Li, W., & Miao, E. (2016). An effective heuristic for no-wait flow shop production to minimize makespan. Journal of Manufacturing Systems, 40, 2-7.
Ye, H., Li, W., Abedini, A., & Nault, B. (2017). An effective and efficient heuristic for no-wait flow shop production to minimize total completion time. Computers & Industrial Engineering, 108, 57-69.