Abstract
Taking into account a real-world issue, the present study focuses on a flexible job shop scheduling problem (FJSSP) that deals with new job arrivals. This problem is very common in real-world manufacturing operations. On the other hand, Industry 5.0 environment pays more attention to human resources, and it is shown that well-being of workers including the stress level of them has a great impact on shop scheduling performance performance. However, with the arrival of a new job, the initial planning needs a rescheduling and these changes on the initial schedule may increase the stress level of workers. Still, given the real-world problem, we want to minimize the stress level of different rescheduling strategies. Three types of changes will be imposed to the shop floor schedule, which could lead to an increased stress level on human resources. These changes are as follows: 1 - Shifting an old operation on the same machine when the new job arrives; 2 - changing the machine assigned to an operation; 3 - altering the sequence of the operations.
The procedure for calculating the different kinds of changes affected by the new job arrivals is illustrated in order to find the level of imposed stress. To solve such an NP-Hard problem, a Genetic Algorithm (GA) is investigated to solve it. At first an initial schedule is built based on benchmark instances from FJSSP literature. Then, at different times, new jobs will arrive, with routes taken from the same instance. The instances are used to validate the proposed algorithm. Behavior of the algorithm on very large problems indicates that obtained schedules remain as compact as expected while considering the stress criterion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Destouet, C., et al.: Flexible job shop scheduling problem under Industry 5.0: a survey on human reintegration, environmental consideration and resilience improvement. J. Manuf. Syst. 67, 155–173 (2023)
Ali, R., El-Kholany, M.M., Gebser, M.: Flexible job-shop scheduling for semiconductor manufacturing with hybrid answer set programming (application paper). In: Hanus, M., Inclezan, D. (eds.) PADL 2023. LNCS, vol. 13880, pp. 85–95. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-24841-2_6
Zeng, R., Wang, Y.: A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem. EURASIP J. Wirel. Commun. Netw. 2018(1), 1–10 (2018)
Buddala, R., Mahapatra, S.S.: Two-stage teaching-learning-based optimization method for flexible job-shop scheduling under machine breakdown. Int. J. Adv. Manuf. Technol. 100(5), 1419–1432 (2019)
Lin, J., Zhu, L., Wang, Z.-J.: A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem. Comput. Ind. Eng. 127, 1089–1100 (2019)
Gong, G., et al.: A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. Int. J. Prod. Res. 58(14), 4406–4420 (2020)
Meng, L., et al.: MILP models for energy-aware flexible job shop scheduling problem. J. Clean. Prod. 210, 710–723 (2019)
Caldeira, R.H., Gnanavelbabu, A., Vaidyanathan, T.: An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput. Ind. Eng. 149, 106863 (2020)
Gao, K.Z., et al.: Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl.-Based Syst. 109, 1–16 (2016)
Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)
Sajadi, S.M., et al.: Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach. Int. J. Math. Oper. Res. 14(2), 268–289 (2019)
Zhang, J.-D., et al.: DeepMAG: deep reinforcement learning with multi-agent graphs for flexible job shop scheduling. Knowl.-Based Syst. 259, 110083 (2023)
Sun, K., et al.: Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system. Expert Syst. Appl. 215, 119359 (2023)
Lou, H., et al.: Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors. Swarm Evol. Comput. 75, 101204 (2022)
Vieira, G.E., Herrmann, J.W., Lin, E.: Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J. Sched. 6(1), 39–62 (2003)
Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. J. Sched. 12, 417–431 (2009)
Al-Hinai, N., ElMekkawy, T.Y.: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int. J. Prod. Econ. 132(2), 279–291 (2011)
Nouiri, M., et al.: Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns. Comput. Ind. Eng. 112, 595–606 (2017)
El Khoukhi, F., Boukachour, J., Alaoui, A.E.H.: The “dual-ants colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput. Ind. Eng. 106, 236–255 (2017)
Gao, K.Z., et al.: Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion. Comput. Ind. Eng. 90, 107–117 (2015)
Wu, X., Shen, X., Li, C.: The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput. Ind. Eng. 135, 1004–1024 (2019)
Sana, S.S., et al.: Application of genetic algorithm to job scheduling under ergonomic constraints in manufacturing industry. J. Ambient. Intell. Humaniz. Comput. 10, 2063–2090 (2019)
Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job-shop problems. In: PPSN (1992)
Gen, M., Tsujimura, Y., Kubota, E.: Solving job-shop scheduling problems by genetic algorithm. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics. IEEE (1994)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154–160 (1994)
Della Croce, F., Tadei, R., Volta, G.: A genetic algorithm for the job shop problem. Comput. Oper. Res. 22(1), 15–24 (1995)
Yadegari, E., Alem-Tabriz, A., Zandieh, M.: A memetic algorithm with a novel neighborhood search and modified solution representation for closed-loop supply chain network design. Comput. Ind. Eng. 128, 418–436 (2019)
Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 32(1), 1–13 (2002)
Chibani, A., et al.: Dynamic optimisation for highly agile supply chains in e-procurement context. Int. J. Prod. Res. 56(17), 5904–5929 (2018)
Acknowledgement
The authors gratefully acknowledge the financial support of the Region Auvergne-Rhône-Alpes under project “PSPC Régions AAP 2 - Easy Smart Factory”, and the members of the project’s consortium.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 IFIP International Federation for Information Processing
About this paper
Cite this paper
Yadegari, E., Lamy, D., Delorme, X. (2023). Reactive Flexible Job Shop Problem with Stress Level Consideration. In: Alfnes, E., Romsdal, A., Strandhagen, J.O., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures. APMS 2023. IFIP Advances in Information and Communication Technology, vol 691. Springer, Cham. https://doi.org/10.1007/978-3-031-43670-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-031-43670-3_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43669-7
Online ISBN: 978-3-031-43670-3
eBook Packages: Computer ScienceComputer Science (R0)