Document Type : Original Article


1 Iran University of Science & Technology (IUST), Tehran, Iran.

2 Academic Center for Education, Culture and Research (ACECR), Tabriz, Iran.

3 School of Industrial Engineering, Iran University of Science and Technology (IUST), Tehran, Iran.


This paper discusses the modeling and solution of a flexible flow shop scheduling problem with forward and reverse flow (FFSP-FR). The purpose of presenting this mathematical model is to achieve a suitable solution to reduce the completion time (Cmax) in forward flow (such as assembling parts to deliver jobs to the customer) and reverse flow (such as disassembling parts to reproduce parts). Other important decisions taken in this model are the optimal assignment of jobs to each machine in the forward and reverse flow and the sequence of processing jobs by each machine. Due to the uncertainty of the important parameters of the problem, the Fuzzy Jiménez method has been used. The results of the analysis with CPLEX solver show that with the increase in the uncertainty rate, due to the increase in the processing time, the Cmax in the forward and reverse flow has increased. GA, ICA and RDA algorithms have been used in the analysis of numerical examples with a larger size due to the inability of the CPLEX solver. These algorithms are highly efficient in achieving near-optimal solutions in a shorter time. Therefore, a suitable initial solution has been designed to solve the problem and the findings show that the ICA with an average of 273.37 has the best performance in achieving the near-optimal solution and the RDA with an average of 31.098 has performed the best in solving the problem. Also, the results of the T-Test statistical test with a confidence level of 95% show that there is no significant difference between the averages of the objective function index and the calculation time. As a result, the algorithms were prioritized using the TOPSIS method and the results showed that the RDA is the most efficient solution algorithm with a utility weight of 0.9959, and the GA and ICA are in the next ranks. Based on the findings, it can be said that industrial managers who have assembly and disassembly departments at the same time in their units can use the results of this research to minimize the maximum delivery time due to the reduction of costs and energy consumption, even though there are conditions of uncertainty


Alinaghian, M., & Goli, A. (2017). Location, allocation and routing of temporary health centers in rural areas in crisis, solved by improved harmony search algorithm. International journal of computational intelligence systems, 10(1), 894-913.
Azaiez, M. N., Gharbi, A., Kacem, I., Makhlouf, Y., & Masmoudi, M. (2022). Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. Computers & Industrial Engineering, 108040.
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.
Castaneda, J., Martin, X. A., Ammouriova, M., Panadero, J., & Juan, A. A. (2022). A Fuzzy Simheuristic for the Permutation Flow Shop Problem under Stochastic and Fuzzy Uncertainty. Mathematics, 10(10), 1760.
Dios, M., Fernandez-Viagas, V., & Framinan, J. M. (2018). Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Computers & Industrial Engineering, 115, 88-99.
Dridi, N. (2019). Minimizing makespan in a three-stage hybrid flow shop with dedicated machines. International Journal of Industrial Engineering Computations, 10(2), 161-176.
Engin, O., & Yılmaz, M. K. (2022). A fuzzy logic based methodology for multi-objective hybrid flow shop scheduling with multi-processor jobs problems and solving with an efficient genetic algorithm. Journal of Intelligent & Fuzzy Systems, (Preprint), 1-13.
Fernandez-Viagas, V. (2022). A speed-up procedure for the hybrid flow shop scheduling problem. Expert Systems with Applications, 187, 115903.
Ghahremani Nahr, J. (2020). Improvement the efficiency and efficiency of the closed loop supply chain: Whale optimization algorithm and novel priority-based encoding approach. Journal of Decisions and Operations Research, 4(4), 299-315.
Gheisariha, E., Tavana, M., Jolai, F., & Rabiee, M. (2021). A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation. Mathematics and Computers in Simulation, 180, 152-178.
Goli, A., & Keshavarz, T. (2021). Just-in-time scheduling in identical parallel machine sequence-dependent group scheduling problem. Journal of Industrial and Management Optimization.
Goli, A., & Malmir, B. (2020). A covering tour approach for disaster relief locating and routing with fuzzy demand. International Journal of Intelligent Transportation Systems Research, 18(1), 140-152.
Goli, A., & Mohammadi, H. (2022). Developing a sustainable operational management system using hybrid Shapley value and Multimoora method: case study petrochemical supply chain. Environment, development and sustainability, 24(9), 10540-10569.
Goli, A., Khademi-Zare, H., Tavakkoli-Moghaddam, R., Sadeghieh, A., Sasanian, M., & Malekalipour Kordestanizadeh, R. (2021). An integrated approach based on artificial intelligence and novel meta-heuristic algorithms to predict demand for dairy products: a case study. Network: computation in neural systems, 32(1), 1-35.
Goli, A., Zare, H. K., Tavakkoli-Moghaddam, R., & Sadeghieh, A. (2019). Hybrid artificial intelligence and robust optimization for a multi-objective product portfolio problem Case study: The dairy products industry. Computers & industrial engineering, 137, 106090.
Jiménez, M., Arenas, M., Bilbao, A., & Rodrı, M. V. (2007). Linear programming with fuzzy parameters: an interactive method resolution. European journal of operational research, 177(3), 1599-1609.
Kian, R. (2021). The Problem of Uninterrupted Hybrid Flow Shop Scheduling with Regard to the Fuzzy Processing Time. International Journal of Innovation in Management, Economics and Social Sciences, 1(1), 94-107.
Kuo, W. H., & Yang, D. L. (2007). Single machine scheduling with past-sequence-dependent setup times and learning effects. Information Processing Letters, 102(1), 22-26.
Li, M., Lei, D., & Cai, J. (2019). Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives. Swarm and Evolutionary Computation, 49, 34-43.
Li, W., Han, D., Gao, L., Li, X., & Li, Y. (2022). Integrated Production and Transportation Scheduling Method in Hybrid Flow Shop. Chinese Journal of Mechanical Engineering, 35(1), 1-20.
Li, Z., Zhong, R. Y., Barenji, A. V., Liu, J. J., Yu, C. X., & Huang, G. Q. (2021). Bi-objective hybrid flow shop scheduling with common due date. Operational Research, 21(2), 1153-1178.
Lin, J. T., & Chen, C. M. (2015). Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing. Simulation Modelling Practice and Theory, 51, 100-114.
Lu, H., & Qiao, F. (2022). An efficient adaptive genetic algorithm for energy saving in the hybrid flow shop scheduling with batch production at last stage. Expert Systems, 39(2), e12678.
Luo, H., Du, B., Huang, G. Q., Chen, H., & Li, X. (2013). Hybrid flow shop scheduling considering machine electricity consumption cost. International Journal of Production Economics, 146(2), 423-439.
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.
Mohd Rose, A. N., & Nik Mohamed, N. M. Z. (2022). Hybrid Flow Shop Scheduling with Energy Consumption in Machine Shop Using Moth Flame Optimization. In Recent Trends in Mechatronics Towards Industry 4.0 (pp. 77-86). Springer, Singapore.
Naderi, B., Ghomi, S. M. T., Aminnayeri, M., & Zandieh, M. (2011). Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time. The International Journal of Advanced Manufacturing Technology, 53(5), 751-760.
Naderi, B., Gohari, S., & Yazdani, M. (2014). Hybrid flexible flow shop problems: Models and solution methods. Applied Mathematical Modelling, 38(24), 5767-5780.
Naderi, B., Zandieh, M., & Fatemi Ghomi, S. M. T. (2009). A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. Journal of intelligent manufacturing, 20(6), 683-694.
Nahr, J. G., Bathaee, M., Mazloumzadeh, A., & Nozari, H. (2021). Cell Production System Design: A Literature Review. International Journal of Innovation in Management, Economics and Social Sciences, 1(1), 16-44.
Nory, F., & Ghahremani Nahr, J. (2019). Robust-possibilistic optimization method at design of a pharmaceutical supply chain network under uncertainty and discount on purchase the raw material. Journal of Modeling in Engineering, 17(58), 249-266.
Nouri, F., Samadzad, S., & Nahr, J. (2019). Meta-heuristics algorithm for two-machine no-wait flow-shop scheduling problem with the effects of learning. Uncertain Supply Chain Management, 7(4), 599-618.
Nozari, H., & Sadeghi, M. E. (2021). Artificial intelligence and Machine Learning for Real-world problems (A survey). International Journal of Innovation in Engineering, 1(3), 38-47.
Nozari, H., Tavakkoli-Moghaddam, R., & Gharemani-Nahr, J. (2022). A Neutrosophic Fuzzy Programming Method to Solve a Multi-Depot Vehicle Routing Model under Uncertainty during the COVID-19 Pandemic. International Journal of Engineering, Transactions B: Applications, 360-371.
Ozsoydan, F. B., & Sağir, M. (2021). Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flow shop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant. Computers & operations research, 125, 105044.
Öztop, H., Tasgetiren, M. F., Eliiyi, D. T., & Pan, Q. K. (2019). Metaheuristic algorithms for the hybrid flowshop scheduling problem. Computers & Operations Research, 111, 177-196.
Parviznejad, P. S., & Asgharizadeh, E. (2021). Modeling and Solving Flow Shop Scheduling Problem Considering Worker Resource. International Journal of Innovation in Engineering, 1(4), 1-17.
Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flow shop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34-54.
Ruiz, R., Şerifoğlu, F. S., & Urlings, T. (2008). Modeling realistic hybrid flexible flow shop scheduling problems. Computers & Operations Research, 35(4), 1151-1175.
Safari, G., Hafezalkotob, A., Malekpour, H., & Khalilzadeh, M. (2022). Competitive scheduling in a hybrid flow shop problem using multi-leader–multi-follower game-A case study from Iran. Expert Systems with Applications, 116584.
Saidi-Mehrabad, M., & Fattahi, P. (2007). Flexible job shop scheduling with tabu search algorithms. The international journal of Advanced Manufacturing technology, 32(5), 563-570.
Shao, W., Shao, Z., & Pi, D. (2021). Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Computers & Operations Research, 136, 105482.
Shapiro, J. F. (1993). Mathematical programming models and methods for production planning and scheduling. Handbooks in operations research and management science, 4, 371-443.
Szmelter-Jarosz, A., Ghahremani-Nahr, J., & Nozari, H. (2021). A neutrosophic fuzzy optimisation model for optimal sustainable closed-loop supply chain network during COVID-19. Journal of Risk and Financial Management, 14(11), 519.
Thomalla, C. S. (2001). Job shop scheduling with alternative process plans. International Journal of Production Economics, 74(1-3), 125-134.
Tirkolaee, E. B., Goli, A., & Weber, G. W. (2020). Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option. IEEE transactions on fuzzy systems, 28(11), 2772-2783.
Tirkolaee, E. B., Goli, A., Ghasemi, P., & Goodarzian, F. (2022). Designing a sustainable closed-loop supply chain network of face masks during the COVID-19 pandemic: Pareto-based algorithms. Journal of Cleaner Production, 333, 130056.
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.
Tran, T. H., & Ng, K. M. (2011). A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. Journal of Scheduling, 14(5), 483-500.
Villarinho, P. A., Panadero, J., Pessoa, L. S., Juan, A. A., & Oliveira, F. L. C. (2021). A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs. International Transactions in Operational Research, 28(2), 716-737.
Wang, C. N., Hsu, H. P., Fu, H. P., Phan, N. K. P., & Van Thanh Nguyen. (2022). Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan. Comput. Syst. Sci. Eng., 40(1), 17-36.
Wang, S., Liu, M., & Chu, C. (2015). A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. International Journal of Production Research, 53(4), 1143-1167.
Yan, X., & Wu, X. (2022). IMOEA/D to optimize job release problem for a reentrant hybrid flow shop. Computers & Industrial Engineering, 163, 107800.
Yu, C., Andreotti, P., & Semeraro, Q. (2020). Multi-objective scheduling in hybrid flow shop: Evolutionary algorithms using multi-decoding framework. Computers & Industrial Engineering, 147, 106570.
Zandieh, M., FATEMI, G. S., & MOATAR, H. S. (2005). General models for hybrid flow shop sequencing problems with sequence dependent setup times. Journal of faculty of engineering (university of tehran), 39(4), 1-9.
Zheng, J., Wang, L., & Wang, J. J. (2020). A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop. Knowledge-Based Systems, 194, 105536.
Zhu, N., Zhao, F., Wang, L., Ding, R., & Xu, T. (2022). A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows. Expert Systems with Applications, 198, 116921.