Flexible job-shop scheduling problem with the number of workers dependent processing times

Abstract: Studies in the literature on flexible job-shop scheduling problems (FJSP) generally assume that one worker is assigned to each machine and that processing times are constant. However, in some industries, multiple workers with cooperation can process complex operations faster than one worker. If the possibility of completing jobs in a shorter time with worker cooperation is not taken into account, the opportunity to create more effective schedules may not be taken advantage of. Therefore, it is essential to consider the flexibility of collaboration between employees. However, to increase labor efficiency in businesses, jobs are also expected to be done with the minimum number of workers possible. This study considers the FJSP with both machine and number of workers dependent processing times. The objectives are minimizing the total tardiness and the total number of workers. A bi-objective mathematical model and an NSGA-II algorithm for large-sized problems have been proposed. The performance of the proposed solution approaches is demonstrated by using randomly generated test problems. For each problem, the most successful Pareto solution among the obtained solutions by the mathematical model and the NSGA-II algorithm was determined using the TOPSIS method. Furthermore, the effect of the total number of workers on the total tardiness is examined. The performance of proposed solution approaches, and when the worker number increases, the total tardiness of jobs can be reduced by an average of 75.88%, have been shown through comprehensive experimental studies.

How to cite this paper

 Tutumlu, B & Saraç, T. (2025). Flexible job-shop scheduling problem with the number of workers dependent processing times.International Journal of Industrial Engineering Computations , 16(2), 357-370.

Refrences

Defersha, F.M., Obimuyiwa, D., & Yimer, A.D. (2022). Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem. Computers & Industrial Engineering, 171, 108487. https://doi.org/10.1016/j.cie.2022.108487
Gnanavelbabu, A., Caldeira, R.H., & Vaidyanathan, T. (2021). A simulation-based modified backtracking search algorithm for multi-objective stochastic flexible job shop scheduling problem with worker flexibility. Applied Soft Computing, 113, 107960. https://doi.org/10.1016/j.asoc.2021.107960
Gong, G., Deng, Q., Gong, X., & Huang, D. (2021). A non-dominated ensemble fitness ranking algorithm for multi-objective flexible job-shop scheduling problem considering worker flexibility and green factors. Knowledge-Based Systems, 231, 107430. https://doi.org/10.3390/app12010205
Gong, G., Chiong, R., Deng, Q., & Gong, X. (2020) A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. International Journal of Production Research, 58(14), 4406-4420. https://doi.org/10.1080/00207543.2019.1653504
Gong, X., Deng, Q., Gong, G., Liu, W., & Ren, Q. (2018). A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. International Journal of Production Research, 56(7), 2506-2522. https://doi.org/10.1080/00207543.2017.1388933
Grumbach, F., Badr, N.E.A., Reusch, P., & Trojahn, S. (2023). A memetic algorithm with reinforcement learning for sociotechnical production scheduling. IEEE Access. https://doi.org/10.1109/ACCESS.2023.3292548
He, Z., Tang, B., & Luan, F. (2022). An improved African vulture optimization algorithm for dual-resource constrained multi-objective flexible job shop scheduling problems. Sensors, 23(1), 90. https://doi.org/10.3390/s23010090
Kress, D., Müller, D., & Nossack, J. (2019). A worker constrained flexible job shop scheduling problem with sequence-dependent setup times. OR spectrum, 41, 179-217. https://doi.org/10.1007/s00291-018-0537-z
Liu, C., Yao. Y., & Zhu, H. (2021). Hybrid salp swarm algorithm for solving the green scheduling problem in a double-flexible job shop. Applied Sciences, 12(1), 205. https://doi.org/10.3390/app12010205
Luo, Q., Deng, Q., Xie, G., & Gong, G. (2023). A Pareto-based two-stage evolutionary algorithm for flexible job shop scheduling problem with worker cooperation flexibility. Robotics and Computer-Integrated Manufacturing, 82, 102534. https://doi.org/10.1016/j.rcim.2023.102534
Luo, Q., Deng, Q., Gong, G., Guo, X., & Liu, X. (2022). A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Systems with Applications, 207, 117984. https://doi.org/10.1016/j.eswa.2022.117984
Lou, H., Wang, X., 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, 75, 101204. https://doi.org/10.1016/j.swevo.2022.101204
Meng, L., Zhang, C., Zhang, B., & Ren, Y. (2019). Mathematical modeling and optimization of energy-conscious flexible job shop scheduling problem with worker flexibility. IEEE Access, 7, 68043-68059. https://doi.org/10.1109/ACCESS.2019.2916468
Renna, P., Thürer, M., & Stevenson, M. (2020). A game theory model based on Gale-Shapley for dual-resource constrained (DRC) flexible job shop scheduling. International Journal of Industrial Engineering Computations, 11(2), 173-184. https://doi.org/10.5267/j.ijiec.2019.11.001
Saraç, T., & Ozcelik, F. (2023). A matheuristic algorithm for multi-objective unrelated parallel machine scheduling problem. Journal of the Faculty of Engineering and Architecture of Gazi University, 38(3), 1953-1966. https://doi.org/10.17341/gazimmfd.873295
Shi, J., Chen, M., Ma, Y., & Qiao, F. (2023). A new boredom-aware dual-resource constrained flexible job shop scheduling problem using a two-stage multi-objective particle swarm optimization algorithm. Information Sciences, 643, 119141. https://doi.org/10.1016/j.ins.2023.119141
Tan, W., Yuan, X., Wang, J., & Zhang, X. (2021). A fatigue-conscious dual resource constrained flexible job shop scheduling problem by enhanced NSGA-II: An application from casting workshop. Computers & Industrial Engineering, 160, 107557. https://doi.org/10.1016/j.cie.2021.107557
Vital-Soto, A., Baki, M.F., & Azab, A. (2022). A multi-objective mathematical model and evolutionary algorithm for the dual-resource flexible job-shop scheduling problem with sequencing flexibility. Flexible Services and Manufacturing Journal, 1-43. https://doi.org/10.1007/s10696-022-09446-x
Yan, Q., Wang, H., & Wu, F. (2022). Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm. Computers & Operations Research, 144, 105823. https://doi.org/10.1016/j.cor.2022.105823
Zhang, S., Hou, T., Qu, Q., Glowacz, A., Alqhtani, S.M., Irfan, M., & Li, Z. (2022). An improved mayfly method to solve distributed flexible job shop scheduling problem under dual resource constraints. Sustainability, 14(19), 12120. https://doi.org/10.3390/su141912120
Zheng, X.L., & Wang, L. (2016). A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. International Journal of Production Research, 54(18), 5554-5566. https://doi.org/10.1080/00207543.2016.1170226