Developing and solving the multi-objective flexible and sustainable job shop scheduling problem with reverse flow and job rotation considerations in uncertain situations

Subject Areas :

Arsalan Shojaei ¹ , Davood Jafari ² , Mehran Khalag ³ , Parshang Dokohaki ⁴

1 -
2 -
3 -
4 -

Received: 2022-07-18 Accepted : 2023-12-14 Published : 2024-09-01

Keywords: Flexible job shop, Scheduling, Job Rotation, Uncertain, The whale optimization algorithm (WOA),

Abstract :

Flexible job shop scheduling problem (FJSP) has received a lot of attention in recent years, but the important point is that this field of study can be subject to many assumptions and lots of innovations can be considered. One of these can be reverse flow, which has been overlooked in many studies, while its effect on the cost and time of construction is undeniable. Other areas such as job rotation as well as issues related to sustainability can be of particular importance in this area and have not been reviewed in previous researches. Therefore, the present study seeks to provide a model to optimize the multi-objective flexible job shop scheduling problem concerning the issues of sustainability with reverse flow and job rotation considerations. For this purpose, a multi-objective mathematical scheduling model is developed, the first goal of which is to minimize the construction time and the second goal is to minimize the issues related to sustainability. To solve the model, two methods were used: Sensitivity analysis and meta-heuristic. The whale optimization algorithm (WOA) was employed in the meta-heuristic method. The results of the implementation of WOA indicate the efficiency of the proposed algorithm, while the findings of the sensitivity analysis also point to the effect of research innovations on the objective functions of the problem.

References:

Apornak. A, Raissi, Mohammad Reza Pourhassan, (2021) Solving flexible flow-shop problem using hybrid multi-criteria Taguchi-based computer simulation model and DEA approach, Journal of Industrial and Systems Engineering, Vol. 13, No. 2, pp. 264-276, Spring (April) 2021.

Bashi Varshosaz. M., Nadri. B., & Mohammadi. M. (2018) “Modeling and Scheduling Two-stage Assembly Flow Shop Problems with Non-Identical Assembly Machines,”  Computational Methods in Engineering, 37(1),  65 – 81.

Beheshtinia. M, & Hassani Bidgoli. M. (2017) “Scheduling in Flexible Jobshop Environment Considering Assembling and Sequence Dependent Processing Times,” Journal of Operational Research and Its Applications, 13 (4),  21-37.

Błażewicz, J. Pesch, E, & Sterna, M.  (2000)  “The disjunctive graph machine representation of the job shop scheduling problem,” European Journal of Operational Research, 127 (2),  317-331.

Dauzère-Pérès, S., Ding, J., L.& Karim Tamssaouet, K. (2023).The flexible job shop scheduling problem: A review, European Journal of Operational Research, In press,  https://doi.org/10.1016/j.ejor.2023.05.017.

Degardi, H. & Rahimi Qashqaei, M. (2010) “Flexible job shop scheduling problem considering maintenance and repair constraints,” Journal of industrial engineering and management of Sharif Univesity; 26(1), 101-115.

Ding, H. & Gu, X.(2020).Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem, Neurocomputing, Vol. 414, 313-332. https://doi.org/10.1016/j.neucom.2020.07.004.

Fan, J., Shen, W., Gao, L., Zhang, C. & Zhang, Z.(2021). A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths, Journal of Manufacturing Systems,Vol.60,298-311. https://doi.org/10.1016/j.jmsy.2021.05.018.

Fattahi, P. & Daneshamooz, F. (2016) Providing a model for workshop production line scheduling by considering the cargo flow along with a parallel assembly step,” Operation research and its applications, 13 (3), 53-73.

Fattahi. P, Bagheri Rad. N., & Daneshamooz, F. (2018)  “Solving flexible job shop scheduling problem with an assembly stage and sequence-dependent setup time,”  Sharif Journal of Industrial Engineering and Management, 34.1 (2.2), 119-131.

 Gao, J., Sun, L., &  Gen, M. (2008)  "A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems", Computers & Operations Research, 35(9),  2892 – 2907.

Gen, M.,  Gao, J., & Lin,  L. (2009)  “Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem”, Intelligent and Evolutionary Systems,  187,  183-196. 5] Graham, R. (1966)  "Bounds for certain multiprocessing anomalies", Bell System Technical Journal, 45 (9), 1563–1581.

Gong, G., Tang, J., Huang, D., Luo, Q., Zhu, K. & Peng, N. (2024). Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility, Swarm and Evolutionary Computation, Vol. 84,  February 2024, 101421. https://doi.org/10.1016/j.swevo.2023.101421.

Haji. R, & Taghizadeh. H. (2005) “Algorithm of determining Product's Batch Size and Sequence of the Operations of n Job on m Machine,” Journal of future studies management, 65, 41-53.

Ham, A.  (2017) “Flexible job shop scheduling problem for parallel batch processing machine with compatible job families”,  Applied Mathematical. Modeling,  45,  551-562.

Ho, N.B., Tay, J.C., & Lai, E.M. (2006) "An effective architecture for learning and evolving flexible job-shop schedules",  European Journal of Operational Research, 179,  316-333.

Hurink, E.,  Jurisch, B., & Thole, M. (1994)  "Tabu search for the job shop scheduling problem with multi-purpose machines", Operations Research Spectrum,  15, 205-215

Hurtubise, S.  Olivier, C. & Gharbi. A, (2004). “Planning Tools for Managing the Supply Chain”. Computers & Industrial Engineering,  46,  763–779.

Kim, Y.K.,  Park, K., & ko, J. (2003) "A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling," Computers & Operations Research, 30,  1151-1171.

Kreipl, S. & Pinedo, M. (2009)  “Planning and Scheduling in Supply Chains: An Overview of Issues in Practice,”  Production and Operations Management  13(1), 77–92.

Lei, K., Guo, P., Zhao, W.,Wang, Y., Qian, L., Meng, X. Liansheng Tang, L.(2022). A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem, Expert Systems with Applications, Vol. 205, 117796, https://doi.org/10.1016/j.eswa.2022.117796.

Li, X. Guo, X.,Tang, H. Wu, R.,  Wang, L., Pang, S.,Liu, Z., Xu, W. & Li, X. (2022). Survey of integrated flexible job shop scheduling problems, Computers & Industrial Engineering, Vol. 174, 108786, https://doi.org/10.1016/j.cie.2022.108786.

Lou, H.,Wang, X., Zhiming Dong, Z. & Yang,Y.(2022). Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors, Swarm and Evolutionary Computation,Vol.75,101204, https://doi.org/10.1016/j.swevo.2022.101204.

Luo, X., Qian, Q. & Fa Fu,Y.(2020).Improved Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem, Procedia Computer Science,Vol.166,480-485.https://doi.org/10.1016/j.procs.2020.02.061.

Asadzadeh, L. & Zamanifar, K. (2010)  “An agent-based parallel approach for the job shop scheduling problem with genetic algorithms,” Math. Comput. Model,  52,  11–12.

Manne. A. S.  (1960)  “On the job shop scheduling problem,” Operational Research,  8(2),  219-223.

Mastrolilli, M. & Gambardella, L.M. (2002) "Effective neighborhood functions for the flexible job shop problem," Journal of Scheduling,  3, 3-20.

Nahavandi, N. &  Abbasian, M. (2011) “Multi-Objective Flexible Dynamic Job-Shop Scheduling Problem Considering Maintenance Constraint,” International Journal of industrial engineering and production management, 22 (1), 13-26.

 Namazi, A. & Golmakani, H.  (2013)  “Multiple Route Job Shop Scheduling with Maintenance Activity Constraints,”  International Journal of industrial engineering and production management,  23 (4),  459-470.

Pezzella, F., Morganti, G., & Ciaschetti, G. (2008) "A genetic algorithm for the flexible Job-shop scheduling problem,"  Computers & Operations Research,  35(10)  3202-3212.

Prause da Silva, D.,Santos Inoue, R.& Rodrigues Kato,E.(2024). Scheduling choice method for flexible job shop problems using a fuzzy decision maker, Intelligent Systems with Applications,Vol.21, 200302, https://doi.org/10.1016/j.iswa.2023.200302.

Raissi. S,  Rooeinfar. R, Ghezavati. VR, (2019) Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint, Journal of Optimization in Industrial Engineering, Vol. 12, Issue 2, 131-147.

Reiter, S. (1966)  “A system for managing job-shop production,” Journal of Business,  39 (3),  371– 393.

 Rooeinfar. R, Raissi. S, Ghezavati. VR,  (2019), Stochastic flexible flow shop scheduling problem with limited buffers and fixed interval preventive maintenance: a hybrid approach of simulation and metaheuristic algorithms, Journal of Simulation, Vol.95, Issue 6, 509-528.

Rossi, A. & Dini, G. (2007) "Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method," Robotics and Computer-Integrated Manufacturing,  23(5),  503-516

Saidi-Mehrabad, M. & Fattahi, P. (2006) "Flexible job shop scheduling with tabu search algorithms,"  The International Journal of Advanced Manufacturing Technology,  32,  563-570.

Shen, L., Dauzère-Pérès, S. & Neufeld, J. S. (2018) "Solving the flexible job shop scheduling problem with sequence-dependent setup times",  European Journal of Operational Research,     265(2),  503-516.

Tutumlu, B. & Tugba Saraç, T. (2023).A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting, Computers & Operations Research, Vol.155,106222, https://doi.org/10.1016/j.cor.2023.106222.

Wagner, H.  (1959)  “An integer linear-programming model for machine scheduling,”  Naval Research logistics Quarterly,  6 (2),  131-140.

Yazdani, M. & Naderi, B.  (1998) “Modelling Multi-Mode Resource-Constrained Flow Shop Scheduling Problem”,  Industrial management studies,  47, 151-167.