Al-Salem, A. (2004). A Heuristic to Minimize Makespan in Proportional Parallel Flow Shops. International Journal of Computing & Information Sciences, 2(2), 98.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 246(2), 345–378.
Cao, D., & Chen, M. (2003). Parallel flowshop scheduling using Tabu search. International Journal of Production Research, 41(13), 3059–3073.
Companys, R. (1966). Métodos heurísticos en la resolución del problema del taller mecánico. Estudios Empresariales, 5(2), 7–18.
Fernandez-Viagas, V., & Framinan, J. M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53(4), 1111–1123.
Gao, J., & Chen, R. (2011). An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems, 6(14), 3094–3100.
Gao, J., Chen, R., & Deng, W. (2013). An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 51(3), 641–651.
Gao, J., Chen, R., Deng, W., & Liu, Y. (2012). Solving multi-factory flowshop problems with a novel variable neighbourhood descent algorithm. Journal of Computational Information Systems, 8(5), 2025–2032.
Gong, H., Tang, L., & Duin, C. W. (2010). A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers & Operations Research, 37(5), 960–969.
He, D. W., Kusiak, A., & Artiba, A. (1996). A scheduling problem in glass manufacturing. IIE Transactions , 28(2), 129–139.
Jiang, Y., & Wan, S. (2011). Parallel flow shop scheduling problem using quantum algorithm. In International Conference on Applied Informatics and Communication (pp. 269-274). Springer, Berlin, Heidelberg.
Johnson, S. M. (1954). Optimal two-and three-stage production schedules with set up times included. Naval Research Logistics Quarterly, 1(1), 61–68.
Lin, S.-W., Ying, K.-C., & Huang, C.-Y. (2013). Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning. Computers & Operations Research, 40(5), 1186–1195.
Liu, H., & Gao, L. (2010). A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem. In 2010 International Conference on Manufacturing Automation (pp. 156–163). IEEE
Martinez, S., Dauzère-Pérès, S., Guéret, C., Mati, Y., & Sauer, N. (2006). Complexity of flowshop scheduling problems with a new blocking constraint. European Journal of Operational Research, 169(3), 855–864.
McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an assembly line with blocking to minimize Cycle Time. Operations Research, 37(6), 925–936.
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.
Naderi, B., & Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4), 754–768.
Naderi, B., & Ruiz, R. (2014). A scatter search algorithm for the distributed permutation flowshop scheduling problem. European Journal of Operational Research, 239(2), 323–334.
Nawaz, M., Enscore Jr, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.
Palmer, D. S. (1965). Sequencing jobs through a multi-stage process in the minimum total time- a quick method of obtaining a near optimum. Operational Research Quarterly, 16(1), 101–107.
Ribas, I., & Companys, R. (2015). Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Computers & Industrial Engineering, 87, 30–39.
Ribas, I., Companys, R., & Tort-Martorell, X. (2017). Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Systems with Applications, 74, 41–54.
Ribas, I., Companys, R., & Tort-Martorell, X. (2019). An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Expert Systems with Applications, 121, 347–361.
Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J., & Kubiak, W. (1992). Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems, 4(3-4), 331–358.
Takano, M. I., & Nagano, M. S. (2019). Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times. International Journal of Industrial Engineering Computations, 10(1), 37–50.
Trovinger, S. C., & Bohn, R. E. (2005). Setup time reduction for electronics assembly: Combining simple (SMED) and IT-based methods. Production and Operations Management, 14(2), 205–217.
Wang, S., Wang, L., Liu, M., & Xu, Y. (2013). An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. International Journal of Production Economics, 145(1), 387–396.
Xu, Y., Wang, L., Wang, S., & Liu, M. (2013). An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Engineering Optimization, 46(9), 1269–1283.
Zhang, X., & Van De Velde, S. (2012). Approximation algorithms for the parallel flow shop problem. European Journal of Operational Research, 216(3), 544–552.