Optimization of Job Shop Scheduling Problem by Genetic Algorithms: Case Study

• Autorzy: Sahar Habbadi , Herrou Brahim , Sekkat Souhail

Identyfikatory

DOI

10.24425/mper.2023.147189

• Języki publikacji: EN

Abstrakty

EN

The Job Shop scheduling problem is widely used in industry and has been the subject of study by several researchers with the aim of optimizing work sequences. This case study provides an overview of genetic algorithms, which have great potential for solving this type of combinatorial problem. The method will be applied manually during this study to understand the procedure and process of executing programs based on genetic algorithms. This problem requires strong decision analysis throughout the process due to the numerous choices and allocations of jobs to machines at specific times, in a specific order, and over a given duration. This operation is carried out at the operational level, and research must find an intelligent method to identify the best and most optimal combination. This article presents genetic algorithms in detail to explain their usage and to understand the compilation method of an intelligent program based on genetic algorithms. By the end of the article, the genetic algorithm method will have proven its performance in the search for the optimal solution to achieve the most optimal job sequence scenario.

Słowa kluczowe

EN

optimization; metaheuristics; scheduling; job shop scheduling problem; genetic algorithms; simulation

• Wydawca: Production Engineering Committee of the Polish Academy of Sciences ; Polish Association for Production Management
• Czasopismo: Management and Production Engineering Review
• Rocznik: 2023
• Tom: Vol. 14, No. 3
• Strony: 44--56
• Opis fizyczny: Bibliogr. 17 poz., rys., tab.

Twórcy

autor

Sahar Habbadi

• Sidi Mohamed Ben Abdellah University, Faculté des Sciences Techniques de Fès, Industrial Engineering Department, Morocco

autor

Herrou Brahim

• Sidi Mohamed Ben Abdellah University, Faculté des Sciences Techniques de Fès, Industrial Engineering Department, Morocco

autor

Sekkat Souhail

• Ecole Nationale Supérieure d’Arts et Métiers ENSAM MEKNES, Industrial Engineering Department, Morocco

Bibliografia

• Asadzadeh, L., & Zamanifar, K., (2010). An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52.
• Báez, S., Angel-Bello, F., Alvarez, A., & Melián-Batista, B. (2019). A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times. Computers & Industrial Engineering, 131, 295-305.
• Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems. Computers & Industrial Engineering, 30(4), 983-997.
• Chien, Ch-F., & Lan, Y-B. (2021). Agent-based approach integrating deep reinforcement learning and hybrid genetic algorithm for dynamic scheduling for Industry 3.5 smart production. Computers & Industrial Engineering, 162, 107782.
• Cohan, F.M. (1984). Can Uniform Selection Retard Random Genetic Divergence Between Isolated Conspecific Populations? Society for the Study of Evolution, 38(3), 495-504.
• Ghasemi, A., Ashoori, A., Heavey, C. (2021). Evolutionary Learning Based Simulation Optimization for Stochastic Job Shop Scheduling Problems. Applied Soft Computing, 106, 107309
• Hoitomt, D.J., Luh, P.B., & Pattipati, K.R. (1993). A practical approach to job-shop scheduling problems. IEEE Transactions on Robotics and Automation, 9(1).
• Kundakcı, N., & Kulak, O. (2016). Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Computers & Industrial Engineering, 96.
• Loukil, T., Teghem, J., Tuyttens, D. (2005). Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research, 161, 42-61.
• Ritwik, K., & Deb, S. (2011). A genetic algorithm-based approach for optimization of scheduling in job shop environment. Journal of Advanced Manufacturing Systems, 10(2), 223-240. DOI: 10.1142/S0219686711 002235.
• Shen, K., De Pessemier, T., Martens, L., & Wout J. (2021). A parallel genetic algorithm for multi-objective flexible flowshop scheduling in pasta manufacturing. Computers & Industrial Engineering, 161, 107659.
• Sun, K., Zheng, D., Song, H., Cheng, Z., Lang, X., Yuan, W., & Wang, J. (2023). Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system. Expert Systems with Applications, 215.
• Swan, J., Adriaensen, S., Brownlee, A.E.I., Hammond, K., Johnson, C.G., Kheiri, A., Krawiec, F., Merelo, J.J., Minku, L.L., Özcan, E., Pappa, G.L., García-Sánchez, P., Sörensen, K., Voß, S., Wagner, M., & White, D.R. (2022). Metaheuristics “In the Large”. European Journal of Operational Research, 297, 393-406.
• Tamssaouet, K., Dauzère-Pérès, S., Knopp, S., Bitar, A., Yugma, C. (2022). Multiobjective optimization for complex flexible job-shop scheduling problems. European Journal of Operational Research, 296(1), 87-100.
• Wein, L.M., Chevalier, P.B., (1992). A Broader View of the Job-Shop Scheduling Problem. Published Online: 1 Jul 1992. DOI: 10.1287/mnsc.38.7.1018.
• Vilcot, G., & Billaut, J.-C. (2008). A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. European Journal of Operational Research, 190.
• Yu, H., & Liang, W. (2001). Neural network and genetic algorithm-based hybrid approach to expanded jobshop scheduling. Computers & Industrial Engineering, 39.