A Review of Metaheuristic Algorithms for Job Shop Scheduling
Keywords:
Job shop scheduling, metaheuristic algorithms, multi-objective, scheduling, scheduling ProblemAbstract
Job shop scheduling (JSS) is a critical problem in the field of operations research and manufacturing, where the goal is to optimize the scheduling of jobs on machines to enhance productivity and efficiency. Combinatorial optimization problems like JSS present significant challenges due to their diverse applications and practical importance. In order to meet this challenge, metaheuristic algorithms have become extremely effective tools. They provide effective solutions that strike a balance between computational cost and solution quality. Given the Nondeterministic Polynomial time (NP)-hard nature of the problem, exact methods are often impractical for large instances, making metaheuristic approaches highly valuable due to their ability to find near-optimal solutions within reasonable computational times. The primary purpose of this review manuscript is to comprehensively analyze and synthesize the current state of research on metaheuristic algorithms applied to JSS. This review categorizes and summarizes contemporary metaheuristic methods such as harmony search, and ant colony optimization, alongside traditional techniques like genetic algorithms, simulated annealing, tabu search, and particle swarm optimization. The fundamental concepts, key components, and typical applications of metaheuristic algorithms are explored. The paper evaluates robustness, scalability, and adaptability of different methods to different problem instances and constraints, and performance metrics, highlighting their strengths and weaknesses. Additionally, this paper reviews recent advancements in hybrid and multi-objective metaheuristic methods aimed at balancing scheduling constraints and improving solution quality and convergence speed. By offering a critical evaluation of the literature, this manuscript aims to identify trends, gaps, and future research directions in the application of metaheuristic algorithms to JSS. The discussion includes an exploration of emerging techniques and their potential impact on the field, as well as the practical implications for industrial applications. The conclusion of the review highlights that while significant advancements have been made, there remain numerous opportunities for innovation and improvement in developing more robust, efficient, and adaptive metaheuristic algorithms. Future research should focus on hybrid approaches, real-time scheduling, and integrating machine learning techniques to further enhance the performance and applicability of these algorithms in complex, real-world JSS problems. This comprehensive review not only serves as a valuable resource for researchers and practitioners but also sets the stage for future innovations in the optimization of complex scheduling problems.
References
M. Geurtsen, J. B. H. C. Didden, J. Adan, Z. Atan, and I. Adan, “Production, maintenance and resource scheduling: a review,” European Journal of Operational Research, vol. 305, no. 2, pp. 501–529, Mar. 2023, doi: 10.1016/j.ejor.2022.03.045.
L. Xue, S. Zhao, A. Mahmoudi, and M. R. Feylizadeh, “Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm,” Complex & Intelligent Systems, vol. 10, no. 3, pp. 4083–4101, Jun. 2024, doi: 10.1007/s40747-024-01374-7.
T. Dokeroglu, T. Kucukyilmaz, and E.-G. Talbi, “Hyper-heuristics: a survey and taxonomy,” Computers & Industrial Engineering, vol. 187, p. 109815, Jan. 2024, doi: 10.1016/j.cie.2023.109815.
V. Tomar, M. Bansal, and P. Singh, “Metaheuristic algorithms for optimization: a brief review,” Multidisciplinary digital publishing institute, Mar. 2024, p. 238. doi: 10.3390/engproc2023059238.
G. Da Col and E. C. Teppan, “Industrial-size job shop scheduling with constraint programming,” Operations Research Perspectives, vol. 9, p. 100249, 2022, doi: 10.1016/j.orp.2022.1002490.
R. A. Liaqait, S. Hamid, S. S. Warsi, and A. Khalid, “A critical analysis of job shop scheduling in context of industry 4.0,” Sustainability, vol. 13, no. 14, p. 7684, Jul. 2021, doi: 10.3390/su13147684.
J. Zhang, G. Ding, Y. Zou, S. Qin, and J. Fu, “Review of job shop scheduling research and its new perspectives under Industry 4.0,” Journal of Intelligent Manufacturing, vol. 30, no. 4, pp. 1809–1830, Apr. 2019, doi: 10.1007/s10845-017-1350-2.
X. Wu, X. Yan, D. Guan, and M. Wei, “A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time,” Engineering Applications of Artificial Intelligence, vol. 131, p. 107790, May 2024, doi: 10.1016/j.engappai.2023.107790.
D. Vivekanandan, S. Wirth, P. Karlbauer, and N. Klarmann, “A reinforcement learning approach for scheduling problems with improved generalization through order swapping,” Journal of computer science and artificial intelligence, Mar 2023, doi: 10.48550/ARXIV.2302.13941.
G. Infantes, S. Roussel, P. Pereira, A. Jacquet, and E. Benazera, “Learning to Solve Job Shop Scheduling under Uncertainty,” Journal of computer science and artificial intelligence, Mar 2024, doi: 10.48550/ARXIV.2404.01308.
Z. Zhou, L. Xu, X. Ling, and B. Zhang, “Digital-twin-based job shop multi-objective scheduling model and strategy,” International Journal of Computer Integrated Manufacturing, vol. 37, no. 1–2, pp. 87–107, Feb. 2024, doi: 10.1080/0951192X.2023.2204475.
P. Penchev, P. Vitliemov, and I. Georgiev, “Optimization model for production scheduling taking into account preventive maintenance in an uncertainty-based production system,” Heliyon, vol. 9, no. 7, pp. e17485, Jul. 2023, doi: 10.1016/j.heliyon.2023.e17485.
M. M. Teshome, T. Y. Meles, and C.-L. Yang, “Productivity improvement through assembly line balancing by using simulation modeling in case of Abay garment industry Gondar,” Heliyon, vol. 10, no. 1, pp. e23585, Jan. 2024, doi: 10.1016/j.heliyon.2023.e23585.
S. Khorasani, E. Körpeoğlu, and V. V. Krishnan, “Dynamic Development Contests,” Operations Research, vol. 72, no. 1, pp. 43–59, Jan. 2024, doi: 10.1287/opre.2021.0420.
M. Aghelinejad, Y. Ouazene, and A. Yalaoui, “Production scheduling optimisation with machine state and time-dependent energy costs,” International Journal of Production Research, vol. 56, no. 16, pp. 5558–5575, Aug. 2018, doi: 10.1080/00207543.2017.1414969.
Y. M. Omar, M. Minoufekr, and P. Plapper, ‘Business analytics in manufacturing: current trends, challenges and pathway to market leadership’, Operations Research Perspectives, vol. 6, pp. 100127, Oct. 2019, doi: 10.1016/j.orp.2019.100127.
Z.-Y. Wang and C. Lu, “An integrated job shop scheduling and assembly sequence planning approach for discrete manufacturing,” Journal of Manufacturing Systems, vol. 61, pp. 27–44, Oct. 2021, doi: 10.1016/j.jmsy.2021.08.003.
P. J. Lederer and L. Li, “Pricing, production, scheduling, and delivery-time competition,” Operations Research, vol. 45, no. 3, pp. 407–420, 1997, Accessed: May 06, 2024. [Online]. Available: https://www.jstor.org/stable/172018.
A. M. Nassef, M. A. Abdelkareem, H. M. Maghrabie, and A. Baroutaji, “Review of metaheuristic optimization algorithms for power systems problems,” Sustainability, vol. 15, no. 12, pp. 9434, Jun. 2023, doi: 10.3390/su15129434.
K. Rajwar, K. Deep, and S. Das, “An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges,” Complex & Intelligent Systems, vol. 56, no. 11, pp. 13187–13257, Nov. 2023, doi: 10.1007/s10462-023-10470-y.
R. P. Badoni et al., “An exploration and exploitation-based metaheuristic approach for university course timetabling problems,” Axioms, vol. 12, no. 8, pp. 720, Jul. 2023, doi: 10.3390/axioms12080720.
L. Davis, “Job shop scheduling with genetic algorithm,” In Proceedings of the First International Conference on Genetic Algorithms and their Applications, J. J. Grefenstette, Ed., New York, Psychology Press, 1985, pp. 136-140. doi: 10.4324/9781315799674.
R. W. Eglese, “Simulated annealing: a tool for operational research,” European Journal of Operational Research, vol. 46, no. 3, pp. 271–281, Jun. 1990, doi: 10.1016/0377-2217(90)90001-R.
M. Widmer, “Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach,” Journal of the Operational Research Society, vol. 42, no. 1, pp. 75–82, Jan. 1991, doi: 10.1057/jors.1991.9.
S.-C. Lin, E. D. Goodman, and W. F. Punch, “Investigating parallel genetic algorithms on job shop scheduling problems,” in Evolutionary Programming VI, vol. 1213, P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 383–393. doi: 10.1007/BFb0014827.
S. K. Mishra and C. S. P. Rao, “Performance comparison of some evolutionary algorithms on job shop scheduling problems,” IOP Conference Series: Materials Science and Engineering, vol. 149, pp. 012041, Sep. 2016, doi: 10.1088/1757-899X/149/1/012041.
M. den Besten, T. Stützle, and M. Dorigo, “Ant Colony Optimization for the Total Weighted Tardiness Problem,” in Parallel Problem Solving from Nature PPSN VI, M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, Eds., Berlin, Heidelberg: Springer, 2000, pp. 611–620. doi: 10.1007/3-540-45356-3_60.
H. Madivada and R. C.S.P, “Improved Music Based Harmony Search (IMBHS) for Solving Job Shop Scheduling Problems (JSSPS),” International journal of Programming Languages and applications, vol. 3, no. 3, pp. 1–15, Jul. 2013, doi: 10.5121/ijpla.2013.3301.
S. Matsui, I. Watanabe, and K. Tokoro, “Real-Coded Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems,” in Parallel Problem Solving from Nature — PPSN VII, vol. 2439, J. J. M. Guervós, P. Adamidis, H.-G. Beyer, H.-P. Schwefel, and J.-L. Fernández-Villacañas, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2002, pp. 800–810. doi: 10.1007/3-540-45712-7_77.
H. W. Ge, Y. C. Liang, Y. Zhou, and X. C. Guo, “A particle swarm optimization-based algorithm for job-shop scheduling problems,” international journal of computational methods, vol. 02, no. 03, pp. 419–430, Sep. 2005, doi: 10.1142/S0219876205000569.
Chong, C. S., Low, M. Y. H., Sivakumar, A. I., & Gay, K. L. “A bee colony optimization algorithm to job shop scheduling,” In IEEE Proceedings of the 2006 winter simulation conference, pp. 1954-1961, Dec. 2006, doi: https://doi.org/10.1109/WSC.2006.322980.
B. Z. Yao, C. Y. Yang, J. J. Hu, G. D. Yin, and B. Yu, “An improved artificial bee colony algorithm for job shop problem,”
Applied mechanics and materials, vol. 26–28, pp. 657–660, Jun. 2010, doi: 10.4028/www.scientific.net/AMM.26-28.657.
L. Asadzadeh, “A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy,” Computers & Industrial Engineering, vol. 102, pp. 359–367, Dec. 2016, doi: 10.1016/j.cie.2016.06.025.
W. Wisittipanich and V. Kachitvichyanukul, “Differential evolution algorithm for job shop scheduling problem,” Industrial Engineering and Management Systems, vol. 10, no. 3, pp. 203–208, Sep. 2011, doi: 10.7232/iems.2011.10.3.203.
L. Tang, Y. Zhao, and J. Liu, “An improved differential evolution algorithm for practical dynamic scheduling in steelmaking-continuous casting production,” IEEE transactions on evolutionary computation, vol. 18, no. 2, pp. 209–225, Apr. 2014, doi: 10.1109/TEVC.2013.2250977.
S. Hanoun, S. Nahavandi, D. Creighton, and H. Kull, “Solving a multiobjective job shop scheduling problem using Pareto Archived Cuckoo Search,” In Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation, Kracow, Poland, IEEE, Sep. 2012, pp. 1–8. doi: https://doi.org/10.1109/ETFA.2012.6489617.
A. Ouaarab, B. Ahiod, X.-S. Yang, and M. Abbad, “Discrete cuckoo search algorithm for job shop scheduling problem,” in 2014 IEEE International Symposium on Intelligent Control, Juan Les Pins, France, Oct. 2014, pp. 1872–1876. doi: 10.1109/ISIC.2014.6967636.
M. K. Marichelvam and T. Prabaharan, “A bat algorithm for realistic hybrid flowshop scheduling problems to minimize makespan and mean flow time,” ICTACT Journal of Soft Computing, vol. 03, no. 01, pp. 428–433, Oct. 2012, doi: 10.21917/ijsc.2012.0066.
T.-K. Dao, T.-S. Pan, T.-T. Nguyen, and J.-S. Pan, “Parallel bat algorithm for optimizing makespan in job shop scheduling problems,” Journal of Intelligent Manufacturing, vol. 29, no. 2, pp. 451–462, Feb. 2018, doi: 10.1007/s10845-015-1121-x.
Salcedo-Sanz, S., Del Ser, J., Landa-Torres, I., Gil-López, S., & Portilla-Figueras, A., “The coral reefs optimization algorithm: an efficient meta-heuristic for solving hard optimization problems,” In Proceedings of the 15th international conference on applied stochastic models and data analysis, pp. 751-758, Jun. 2013.
Chun-Wei Tsai, Heng-Ci Chang, Kai-Cheng Hu, and Ming-Chao Chiang, “Parallel coral reef algorithm for solving JSP on Spark,” in 2016 IEEE International Conference on Systems, Man, and Cybernetics, Budapest, Hungary, Oct. 2016, pp. 001872–001877. doi: 10.1109/SMC.2016.7844511.
S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey Wolf Optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, Mar. 2014, doi: 10.1016/j.advengsoft.2013.12.007.
C. Lu, S. Xiao, X. Li, and L. Gao, “An effective multi-objective discrete grey wolf optimizer for a real-world scheduling problem in welding production,” Advances in Engineering Software, vol. 99, pp. 161–176, Sep. 2016, doi: 10.1016/j.advengsoft.2016.06.004.
A. G. Gad, “Particle swarm optimization algorithm and its applications: a systematic review,” Archives of Computational Methods in Engineering, vol. 29, no. 5, pp. 2531–2561, Aug. 2022, doi: 10.1007/s11831-021-09694-4.
J.-S. Pan, P. Hu, V. Snášel, and S.-C. Chu, “A survey on binary metaheuristic algorithms and their engineering applications,” Journal of Intelligent Manufacturing, vol. 56, no. 7, pp. 6101–6167, Jul. 2023, doi: 10.1007/s10462-022-10328-9.
H. Zhang, B. Buchmeister, X. Li, and R. Ojstersek, ‘An Efficient Metaheuristic Algorithm for Job Shop Scheduling in a Dynamic Environment’, Mathematics, vol. 11, no. 10, pp. 2336, May 2023, doi: 10.3390/math11102336.
Z. Liang, P. Zhong, M. Liu, C. Zhang, and Z. Zhang, ‘A computational efficient optimization of flow shop scheduling problems’, Scientific reports, vol. 12, no. 1, p. 845, Jan. 2022, doi: 10.1038/s41598-022-04887-8.
B. Jeong, J.-H. Han, and J.-Y. Lee, ‘Metaheuristics for a flow shop scheduling problem with urgent jobs and limited waiting times’, Algorithms, vol. 14, no. 11, pp. 323, Nov. 2021, doi: 10.3390/a14110323.
Khaje Zadeh, S., Shahverdiani, S., Daneshvar, A., & Madanchi Zaj, M., “Predicting the optimal stock portfolio approach of meta-heuristic algorithm and Markov decision process,” Journal of decisions and operations research, vol. 5, no. 4, pp. 426-445, 2021, doi: https://doi.org/10.22105/dmor.2020.239616.1183.
T. Q. Ngo, L. Q. Nguyen, and V. Q. Tran, “Novel hybrid machine learning models including support vector machine with meta-heuristic algorithms in predicting unconfined compressive strength of organic soils stabilised with cement and lime,” International Journal of Pavement Engineering, vol. 24, no. 2, pp. 2136374, Jan. 2023, doi: 10.1080/10298436.2022.2136374.
S. Chen and H. Xu, “Meta-heuristic algorithm-based human resource information management system design and development for industrial revolution 5.0,” Soft Computing, vol. 27, no. 7, pp. 4093–4105, Apr. 2023, doi: 10.1007/s00500-021-06650-z.
N. Manavizadeh, H. Farrokhi-Asl, and P. Beiraghdar, “Using a metaheuristic algorithm for solving a home health care routing and scheduling problem,” Journal of project management, pp. 27–40, 2020, doi: 10.5267/j.jpm.2019.8.001.
P. Sharma and U. Modani, “Trusted cluster-based communication for wireless sensor network using meta-heuristic algorithms,” Journal of tech science press, vol. 45, no. 2, pp. 1935–1951, 2022, doi: 10.32604/csse.2023.031509.
H. Khajavi and A. Rastgoo, “Predicting the carbon dioxide emission caused by road transport using a Random Forest (RF) model combined by Meta-Heuristic Algorithms,” Sustainable Cities and Society, vol. 93, pp. 104503, Jun. 2023, doi: 10.1016/j.scs.2023.104503.
W. Li, H. Dai, and D. Zhang, “The relationship between maximum completion time and total completion time in flowshop production”, Procedia Manufacturing, vol. 1, pp. 146–156, 2015, doi: 10.1016/j.promfg.2015.09.077.
K. Li, Q. Deng, L. Zhang, Q. Fan, G. Gong, and S. Ding, “An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem”, Computers & Industrial Engineering, vol. 155, pp. 107211, May 2021, doi: 10.1016/j.cie.2021.107211.
M. H. Ali, A. Saif, and A. Ghasemi, “Robust job shop scheduling with condition-based maintenance and random breakdowns”, International federation of automatic contrl-PapersOnLine, vol. 55, no. 10, pp. 1225–1230, 2022, doi: 10.1016/j.ifacol.2022.09.557.
C. Cebi, E. Atac, and O. K. Sahingoz, “Job shop scheduling problem and solution algorithms: a review”, in 2020 11th International Conference on Computing, Communication and Networking Technologies, Kharagpur, India, Jul. 2020, pp. 1–7. doi: 10.1109/ICCCNT49239.2020.9225581.
K. Zhou, C. Tan, Y. Zhao, J. Yu, Z. Zhang, and Y. Wu, “Research on solving flexible job shop scheduling problem based on improved gwo algorithm ss-gwo”, Neural Process Lett, vol. 56, no. 1, p. 26, Feb. 2024, doi: 10.1007/s11063-024-11488-1.
M. Yazdani, A. Aleti, S. M. Khalili, and F. Jolai, “Optimizing the sum of maximum earliness and tardiness of the job shop scheduling proble”’, Computers & Industrial Engineering, vol. 107, pp. 12–24, May 2017, doi: 10.1016/j.cie.2017.02.019.
N. Tyagi, R. P. Tripathi, and A. B. Chandramouli, “Single machine scheduling model with total tardiness problem”, Indian Journal of science and technology, vol. 9, no. 37, Oct. 2016, doi: 10.17485/ijst/2016/v9i37/97527.
L. Song, Y. Li, and J. Xu, “Dynamic job-shop scheduling based on transformer and deep reinforcement learning”, Processes, vol. 11, no. 12, pp. 3434, Dec. 2023, doi: 10.3390/pr11123434.
A. Delgoshaei, M. K. A. B. M. Ariffin, and Z. B. Leman, “An effective 4–phased framework for scheduling job-shop manufacturing systems using weighted nsga-ii’, Mathematics, vol. 10, no. 23, Pp. 4607, Dec. 2022, doi: 10.3390/math10234607.
F. Abderrabi et al., “Flexible job shop scheduling problem with sequence dependent setup time and job splitting: hospital catering case study”, Applied Sciences, vol. 11, no. 4, pp. 1504, Feb. 2021, doi: 10.3390/app11041504.
A. Azzouz, A. Chaabani, M. Ennigrou, and L. B. Said, “Handling sequence-dependent setup time flexible job shop problem with learning and deterioration considerations using evolutionary bi-level optimization”, Applied Artificial Intelligence, vol. 34, no. 6, pp. 433–455, May 2020, doi: 10.1080/08839514.2020.1723871.
F. M. Defersha and D. Rooyani, “An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time”, Computers & Industrial Engineering, vol. 147, pp. 106605, Sep. 2020, doi: 10.1016/j.cie.2020.106605.
S. Dauzère-Pérès, J. Ding, L. Shen, and K. Tamssaouet, “The flexible job shop scheduling problem: a review”, European Journal of Operational Research, vol. 314, no. 2, pp. 409–432, Apr. 2024, doi: 10.1016/j.ejor.2023.05.017.
Z. Li and Y. Chen, “Minimizing the makespan and carbon emissions in the green flexible job shop scheduling problem with learning effects”, Scientific Reports, vol. 13, no. 1, pp. 6369, Apr. 2023, doi: 10.1038/s41598-023-33615-z.
J. C. Serrano-Ruiz, J. Mula, and R. Poler, “Job shop smart manufacturing scheduling by deep reinforcement learning”, Journal of Industrial Information Integration, vol. 38, pp. 100582, Mar. 2024, doi: 10.1016/j.jii.2024.100582.
L. Wang, Y. Zhao, and X. Yin, “Precast production scheduling in off-site construction: mainstream contents and optimization perspective”, Journal of Cleaner Production, vol. 405, pp. 137054, Jun. 2023, doi: 10.1016/j.jclepro.2023.137054.
S. Kawaguchi and Y. Fukuyama, “Improved parallel reactive hybrid particle swarm optimization using improved neighborhood schedule generation method for the integrated framework of optimal production scheduling and operational planning of an energy plant in a factory”, Electronics & Communication in Japan, vol. 103, no. 7, pp. 37–48, Jul. 2020, doi: 10.1002/ecj.12237.
C. Jun Tan, S. Hanoun, and C. Peng Lim, “A multi-objective evolutionary algorithm-based decision support system: A case study on job-shop scheduling in manufacturing”, in 2015 Annual IEEE Systems Conference Proceedings, Vancouver, Canada, Apr. 2015, pp. 170–174. doi: 10.1109/SYSCON.2015.7116747.
C. J. Tan et al., “Application of an evolutionary algorithm-based ensemble model to job-shop scheduling”, J Intell Manuf, vol. 30, no. 2, pp. 879–890, Feb. 2019, doi: 10.1007/s10845-016-1291-1.
D. Lee, D. Lee, and K. Kim, “Self-growth learning-based machine scheduler to minimize setup time and tardiness in OLED display semiconductor manufacturing”, Applied Soft Computing, vol. 145, pp. 110600, Sep. 2023, doi: 10.1016/j.asoc.2023.110600.
A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs”, European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, Jun. 2008, doi: 10.1016/j.ejor.2006.06.060.
I. A. Chaudhry and P. R. Drake, “Minimizing flow-time variance in a single-machine system using genetic algorithms”, International Journal of advanced manufacturing technology, vol. 39, no. 3–4, pp. 355–366, Oct. 2008, doi: 10.1007/s00170-007-1221-7.
K. Gowrishankar, C. Rajendran, and G. Srinivasan, “Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date”, European Journal of Operational Research, vol. 132, no. 3, pp. 643–665, Aug. 2001, doi: 10.1016/S0377-2217(00)00170-3.
A. Syarif, A. Pamungkas, R. Kumar, and Mitsuo Gen, “Performance Evaluation of Various Heuristic Algorithms to Solve Job Shop Scheduling Problem (JSSP)”, International Journal of Intelligent Engineering & Systems, vol. 14, no. 2, pp. 334–343, Apr. 2021, doi: 10.22266/ijies2021.0430.30.
A. Delgoshaei et al., “A supervised method for scheduling multi-objective job shop systems in the presence of market uncertainties”, Operation Research, vol. 55, pp. S1165–S1193, 2021, doi: 10.1051/ro/2020082.
G. Wan and B. P.-C. Yen, “Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs”, European Journal of Operational Research, vol. 195, no. 1, pp. 89–97, May 2009, doi: 10.1016/j.ejor.2008.01.029.
V. Poongothai, P. Godhandaraman, and A. A. Jenifer, “Single machine scheduling problem for minimizing total tardiness of a weighted jobs in a batch delivery system, stochastic rework and reprocessing times”, The 11th national conference on mathematical techniques and applications, Chennai, India, Jan. 2019, p. 020132. doi: 10.1063/1.5112317.
V. Boyer, J. Vallikavungal, X. Cantú Rodríguez, and M. A. Salazar-Aguilar, “The generalized flexible job shop scheduling problem”, Computers & Industrial Engineering, vol. 160, pp. 107542, Oct. 2021, doi: 10.1016/j.cie.2021.107542.
X. Zhang and S. Van De Velde, “On-line two-machine job shop scheduling with time lags”, Information Processing Letters, vol. 110, no. 12–13, pp. 510–513, Jun. 2010, doi: 10.1016/j.ipl.2010.04.002.
Y. He, F. Liu, H. Cao, and C. Li, “A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan”, Journal of Central South University of Technology, vol. 12, no. 2, pp. 167–171, Oct. 2005, doi: 10.1007/s11771-005-0033-x.
Z. Wei, W. Liao, and L. Zhang, “Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds”, Expert Systems with Applications, vol. 197, pp. 116785, Jul. 2022, doi: 10.1016/j.eswa.2022.116785.
C. Peng, Z. Li, H. Zhong, X. Li, A. Lin, and Y. Liao, “Research on Multi-Objective Scheduling Algorithm of Job Shop Considering Limited Storage and Transportation Capacity”, IEEE IEEE internet of things journal, vol. 11, pp. 94252–94280, 2023, doi: 10.1109/ACCESS.2023.3285710.
H. Hu, J. He, X. He, W. Yang, J. Nie, and B. Ran, “Emergency material scheduling optimization model and algorithms: A review”, Journal of Traffic and Transportation Engineering, vol. 6, no. 5, pp. 441–454, Oct. 2019, doi: 10.1016/j.jtte.2019.07.001.
P. Schworm, X. Wu, M. Glatt, and J. C. Aurich, “Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing”, Production engineering , vol. 17, no. 1, pp. 105–115, Feb. 2023, doi: 10.1007/s11740-022-01145-8.
A. S. Jain and S. Meeran, “Deterministic job-shop scheduling: Past, present and future”, European Journal of Operational Research, vol. 113, no. 2, pp. 390–434, Mar. 1999, doi: 10.1016/S0377-2217(98)00113-1.
M. M. Ahmadian, M. Khatami, A. Salehipour, and T. C. E. Cheng, “Four decades of research on the open-shop scheduling problem to minimize the makespan,” European Journal of Operational Research, vol. 295, no. 2, pp. 399–426, Dec. 2021, doi: 10.1016/j.ejor.2021.03.026.
K. Tamssaouet, S. Dauzère-Pérès, and C. Yugma, “Metaheuristics for the job-shop scheduling problem with machine availability constraints”, Computers & Industrial Engineering, vol. 125, pp. 1–8, Nov. 2018, doi: 10.1016/j.cie.2018.08.008.
A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and A. Soukhal, “Scheduling problems with variable job processing times”, in Multiagent Scheduling, Springer, Berlin Heidelberg, 2014, pp. 217–260. doi: 10.1007/978-3-642-41880-8_6.
Z. Zhu and X. Zhou, “Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time,” Computers & Industrial Engineering, vol. 149, pp. 106781, Nov. 2020, doi: 10.1016/j.cie.2020.106781.
S. Zhang, H. Du, S. Borucki, S. Jin, T. Hou, and Z. Li, “Dual Resource Constrained Flexible Job Shop Scheduling Based on Improved Quantum Genetic Algorithm,” Machines, vol. 9, no. 6, pp. 108, May 2021, doi: 10.3390/machines9060108.
G. Mauroy, Y. Wardi, and J. M. Proth, “Perturbation analysis of job shop scheduling with multiple job priorities,” in Proceedings of the 1998 IEEE International Conference on Control Applications, Trieste, Italy, 1998, pp. 930–931. doi: 10.1109/CCA.1998.721594.
P. Schworm, X. Wu, M. Klar, M. Glatt, and J. C. Aurich, “Multi-objective quantum annealing approach for solving flexible job shop scheduling in manufacturing”, Journal of Manufacturing Systems, vol. 72, pp. 142–153, Feb. 2024, doi: 10.1016/j.jmsy.2023.11.015.
Ding Zhu, Wu Ping, Zhang Libo, Wang Feng, and Zhang Xuefeng, “A multi-agent ant colony optimization algorithm for earliness/tardiness scheduling with different due window on non-uniform parallel machines,” in International Technology and Innovation Conference 2006, Hangzhou, China: IEEE, pp. 67–71, 2006, doi: 10.1049/cp:20060730.
F. Dugardin, H. Chehade, L. Amodeo, F. Yalaoui, and C. Prins, “Hybrid job shop and parallel machine scheduling problems: minimization of total tardiness criterion,” in Multiprocessor Scheduling, Theory and Applications, E. Levner, Ed., I-Tech Education and Publishing, 2007. doi: 10.5772/5227.
R. L. C. Souza, A. Ghasemi, A. Saif, and A. Gharaei, “Robust job-shop scheduling under deterministic and stochastic unavailability constraints due to preventive and corrective maintenance,” Computers & Industrial Engineering, vol. 168, pp. 108130, Jun. 2022, doi: 10.1016/j.cie.2022.108130.
P. Sharma and A. Jain, “A review on job shop scheduling with setup times,” Proceedings of the institution of mechanical engineers, part b: journal of engineering manufacture, vol. 230, no. 3, pp. 517–533, Mar. 2016, doi: 10.1177/0954405414560617.
M. Vázquez and D. Whitley, “A comparison of genetic algorithms for the static job shop scheduling problem”, in Parallel Problem Solving from Nature PPSN VI, vol. 1917, M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 303–312. doi: 10.1007/3-540-45356-3_30.
Mohan, K. Lanka, and A. N. Rao, “A Review of Dynamic Job Shop Scheduling Techniques,” Procedia Manufacturing, vol. 30, pp. 34–39, 2019, doi: 10.1016/j.promfg.2019.02.006.
S. Katoch, S. S. Chauhan, and V. Kumar, “A review on genetic algorithm: past, present, and future,” Multimedia Tools & Application, vol. 80, no. 5, pp. 8091–8126, Feb. 2021, doi: 10.1007/s11042-020-10139-6.
D. Delahaye, S. Chaimatanan, and M. Mongeau, “Simulated Annealing: From Basics to Applications,” in Handbook of Metaheuristics, vol. 272, pp. 1-35 M. Gendreau and J.-Y. Potvin, Eds., Cham: Springer International Publishing, 2019, doi: 10.1007/978-3-319-91086-4_1.
Z. Lu, A. Martínez-Gavara, J.-K. Hao, and X. Lai, “Solution-based tabu search for the capacitated dispersion problem,” Expert Systems with Applications, vol. 223, p. 119-156, Aug. 2023, doi: 10.1016/j.eswa.2023.119856.
R. Martí, A. Martínez-Gavara, and F. Glover, “Tabu Search,” in Discrete Diversity and Dispersion Maximization: A Tutorial on Metaheuristic Optimization, R. Martí and A. Martínez-Gavara, Eds., Cham: Springer International Publishing, 2023, pp. 137–149. doi: 10.1007/978-3-031-38310-6_7.
A. Soofastaei, “Introductory Chapter: Ant Colony Optimization,” in the Application of Ant Colony Optimization, A. Soofastaei, Ed., IntechOpen, 2022. doi: 10.5772/intechopen.103801.
J. Yi, C. Lu, G. Li, J. Yi, C. Lu, and G. Li, ‘A literature review on latest developments of Harmony Search and its applications to intelligent manufacturing’, Multimedia tools & application, vol. 16, no. 4, pp. 2086–2117, 2019, doi: 10.3934/mbe.2019102.
C. Guo, H. Tang, B. Niu, and C. Boon Patrick Lee, ‘A survey of bacterial foraging optimization’, Neurocomputing, vol. 452, pp. 728–746, Sep. 2021, doi: 10.1016/j.neucom.2020.06.142.
C. Wang, S. Zhang, T. Ma, Y. Xiao, M. Z. Chen, and L. Wang, “Swarm intelligence: a survey of model classification and applications,” Chinese Journal of Aeronautics, pp. S1000936124000931, Mar. 2024, doi: 10.1016/j.cja.2024.03.019.
A. Kumar, D. Kumar, and S. K. Jarial, “A review on artificial bee colony algorithms and their applications to data clustering,” Cybernetics and Information Technologies, vol. 17, no. 3, pp. 3–28, Sep. 2017, doi: 10.1515/cait-2017-0027.
X. Li, J. Lu, C. Yang, and J. Wang, “Research of flexible assembly job-shop batch–scheduling problem based on improved artificial bee colony,” Frontiers in bioengineering & biotechnology, vol. 10, pp. 909548, Aug. 2022, doi: 10.3389/fbioe.2022.909548.
A. Priya, S. Mandal, and Yogesh, “Parallel artificial bee colony algorithm for solving advance industrial productivity problems,” in Advances in Library and Information Science, B. Holland and K. Sinha, Eds., IGI Global, 2024, pp. 21–41. doi: 10.4018/979-8-3693-0807-3.ch002.
L. Asadzadeh, “A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy”, Computers & Industrial Engineering, vol. 102, pp. 359–367, Dec. 2016, doi: 10.1016/j.cie.2016.06.025.
S. K. Mishra, P. S. C. Bose, and C. S. P. Rao, “An invasive weed optimization approach for job shop scheduling problems,” International journal of advanced manufacturing & technology, vol. 91, no. 9–12, pp. 4233–4241, Aug. 2017, doi: 10.1007/s00170-017-0091-x.
P. Shilpa and G. Balaraju, “Job shop scheduling using differential evolution algorithm”, International journal of mechanical and production engineering research and development, vol. 8, no. 3, pp. 327–338, 2018, doi: 10.24247/ijmperdjun201837.
P. Sriboonchandr, N. Kriengkorakot, and P. Kriengkorakot, “Improved differential evolution algorithm for flexible job shop scheduling problems”, Mathematical computation application, vol. 24, no. 3, p. 80, Sep. 2019, doi: 10.3390/mca24030080.
S. Singh and K. P. Singh, “Cuckoo search optimization for job shop scheduling problem,” in Proceedings of Fourth International Conference on Soft Computing for Problem Solving, vol. 335, K. N. Das, K. Deep, M. Pant, J. C. Bansal, and A. Nagar, Eds., New Delhi: Springer India, 2015, pp. 99–111. doi: 10.1007/978-81-322-2217-0_9.
A. Ouaarab, B. Ahiod, and X.-S. Yang, “Discrete cuckoo search applied to job shop scheduling problem,” in Recent Advances in Swarm Intelligence and Evolutionary Computation, vol. 585, X.-S. Yang, Ed., Cham: Springer International Publishing, 2015, pp. 121–137. doi: 10.1007/978-3-319-13826-8_7.
S. Batubara, D. K. Sari, and D. A. Wicaksono, "Design of job scheduling using bat algorithm to minimize makespan in hybrid flowshop," In Proceedings of the International Conference on Industrial Engineering and Operations Management Dubai, UAE, March 10-12, 2020, pp. 2606-2617. Available at https://www.ieomsociety.org/ieom2020/papers/618.pdf.
T.-K. Dao, T.-S. Pan, T.-T. Nguyen, and J.-S. Pan, “Parallel bat algorithm for optimizing makespan in job shop scheduling problems,” Journal of intelligent manufacturing, vol. 29, no. 2, pp. 451–462, Feb. 2018, doi: 10.1007/s10845-015-1121-x.
Chun-Wei Tsai, Heng-Ci Chang, Kai-Cheng Hu, and Ming-Chao Chiang, “Parallel coral reef algorithm for solving JSP on Spark,” in 2016 IEEE International Conference on Systems, Man, and Cybernetics, Budapest, Hungary, Oct. 2016, pp. 001872–001877. doi: 10.1109/SMC.2016.7844511.
T. Jiang and C. Zhang, “Application of grey wolf optimization for solving combinatorial problems: job shop and flexible job shop scheduling cases”, IEEE Access, vol. 6, pp. 26231–26240, 2018, doi: 10.1109/ACCESS.2018.2833552.
C. Zhang, K. Wang, Q. Ma, X. Li, and L. Gao, “A discrete grey wolf optimizer for solving flexible job shop scheduling problem with lot-streaming,” in 2021 IEEE 24th International Conference on Computer Supported Cooperative Work in Design (CSCWD), Dalian, China: IEEE, May 2021, pp. 969–974. doi: 10.1109/CSCWD49262.2021.9437886.
M. S. Viana, O. Morandin Junior, and R. C. Contreras, “A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem,” Sensors, vol. 20, no. 18, p. 5440, Sep. 2020, doi: 10.3390/s20185440.
Y. Song, F. Wang, and X. Chen, “An improved genetic algorithm for numerical function optimization,” Applied Intelligence, vol. 49, no. 5, pp. 1880–1902, May 2019, doi: 10.1007/s10489-018-1370-4.
I. Chaouch, O. B. Driss, and K. Ghedira, “A modified ant colony optimization algorithm for the distributed job shop scheduling problem,” Procedia Computer Science, vol. 112, pp. 296–305, 2017, doi: 10.1016/j.procs.2017.08.267.
W. Teekeng, A. Thammano, P. Unkaw, and J. Kiatwuthiamorn, “A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization,” Artificial Life & Robotics, vol. 21, no. 1, pp. 18–23, Mar. 2016, doi: 10.1007/s10015-015-0259-0.
B. Denkena, F. Schinkel, J. Pirnay, and S. Wilmsmeier, “Quantum algorithms for process parallel flexible job shop scheduling,” CIRP Journal of Manufacturing Science and Technology, vol. 33, pp. 100–114, May 2021, doi: 10.1016/j.cirpj.2021.03.006.
Z. Yongsuo, Z. Caimeng, H. Yinsheng, Q. Pengrui, and S. Wangjiao, “Research on JOB SHOP Scheduling Problem,” Journal of Physics.: Conference Series, vol. 1607, no. 1, p. 012050, Aug. 2020, doi: 10.1088/1742-6596/1607/1/012050.
Siregar, I. Rizkya, R. M. Sari, and K. Syahputri, “Minimization of makespan using fcfs method and genetic algorithm method comparison in aluminum industry,” in 2019 3rd International Conference on Electrical, Telecommunication and Computer Engineering (ELTICOM), Medan, Indonesia: IEEE, pp. 9–12, sept. 2019, doi: 10.1109/ELTICOM47379.2019.8943914.
S.-J. Wang, C.-W. Tsai, and M.-C. Chiang, “A high performance search algorithm for job-shop scheduling problem,” Procedia Computer Science, vol. 141, pp. 119–126, 2018, doi: 10.1016/j.procs.2018.10.157.
R. Hu, X. Wu, B. Qian, J. Mao, and H. Jin, “Differential evolution algorithm combined with uncertainty handling techniques for stochastic reentrant job shop scheduling problem,” Complexity, vol. 2022, pp. 1–11, Jan. 2022, doi: 10.1155/2022/9924163.
T. H. Son, H. X. Long, N. Huynh-Tuong, and T. Van Lang, “An approach for the teamwork scheduling problem with job-person constraint,” in 2022 9th NAFOSTED Conference on Information and Computer Science, Ho Chi Minh City, Vietnam, pp. 64–68, Oct. 2022 doi: 10.1109/NICS56915.2022.10013369.
P. Liu, K. Xu, H. Gong, “Non-cooperative game of coordinated scheduling of parallel machine production and Transportation in shared manufacturing,” Computers, materials & continua, Vol. 76, no.1, pp. 239-258, 2023, doi: 10.32604/cmc.2023.038232.
A. Campo, J. A. Cano, R. Gómez-Montoya, E. Rodríguez-Velásquez, and P. Cortés, “Flexible job shop scheduling problem with fuzzy times and due-windows: minimizing weighted tardiness and earliness using genetic algorithms,” Algorithms, vol. 15, no. 10, pp. 334, Sep. 2022, doi: 10.3390/a15100334.
H. Zhang, B. Buchmeister, X. Li, and R. Ojstersek, “Advanced metaheuristic method for decision-making in a dynamic job shop scheduling environment,” Mathematics, vol. 9, no. 8, pp. 909, Apr. 2021, doi: 10.3390/math9080909.
N. Kumar and A. Mishra, “Comparative study of different heuristics algorithms in solving classical job shop scheduling problem,” Materials Today: Proceedings, vol. 22, pp. 1796–1802, 2020, doi: 10.1016/j.matpr.2020.03.013.
L. Wang, G. Zhou, Y. Xu, S. Wang, and M. Liu, “An effective artificial bee colony algorithm for the flexible job-shop scheduling problem,” International journal of advanced manufacturing & technology, vol. 60, no. 1–4, pp. 303–315, Apr. 2012, doi: 10.1007/s00170-011-3610-1.
R. Zarrouk, I. E. Bennour, and A. Jemai, “A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem,” Swarm Intelligence, vol. 13, no. 2, pp. 145–168, Jun. 2019, doi: 10.1007/s11721-019-00167-w.
Hajibabaei and J. Behnamian, “Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: a tabu search algorithm,” International Journal of Management Science and Engineering Management, vol. 16, no. 4, pp. 242–253, Oct. 2021, doi: 10.1080/17509653.2021.1941368.
A. Dabah, A. Bendjoudi, A. AitZai, and N. N. Taboudjemat, “Efficient parallel tabu search for the blocking job shop scheduling problem,” Soft Computing, vol. 23, no. 24, pp. 13283–13295, Dec. 2019, doi: 10.1007/s00500-019-03871-1.
Alharkan, M. Saleh, M. A. Ghaleb, H. Kaid, A. Farhan, and A. Almarfadi, “Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server,” Journal of King Saud University - Engineering Sciences, vol. 32, no. 5, pp. 330–338, Jul. 2020, doi: 10.1016/j.jksues.2019.03.006.
Y. Yu, “A research review on job shop scheduling problem,” E3S Web Conf., vol. 253, p. 02024, 2021, doi: 10.1051/e3sconf/202125302024.
Hasani, S. A. Kravchenko, and F. Werner, “Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances,” Engineering Optimization, vol. 48, no. 1, pp. 173–183, Jan. 2016, doi: 10.1080/0305215X.2015.1005083.
Hasani, S. A. Kravchenko, and F. Werner, “Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server,” International Journal of Production Research, vol. 52, no. 13, pp. 3778–3792, Jul. 2014, doi: 10.1080/00207543.2013.874607.
F. M. Defersha and M. Chen, “A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups,” International journal of advanced manufacturing & technology, vol. 49, no. 1–4, pp. 263–279, Jul. 2010, doi: 10.1007/s00170-009-2388-x.
W. N. Abdullah and S. A. Alagha, “A parallel adaptive genetic algorithm for job shop scheduling problem,” Journal of physics: Conference Series, vol. 1879, no. 2, p. 022078, May 2021, doi: 10.1088/1742-6596/1879/2/022078.
Z. Liu et al., “An improved genetic algorithm with an overlapping strategy for solving a combination of order batching and flexible job shop scheduling problem,” Engineering Applications of Artificial Intelligence, vol. 127, p. 107321, Jan. 2024, doi: 10.1016/j.engappai.2023.107321.
Kumar, P., Ghangas, G., Sharma, A., & Dhull, S., “Minimising the makespan of job shop scheduling problem by using genetic algorithm (GA),” International journal of production engineering, vol. 6, pp. 27-39, 2020.
S. Habbadi, B. Herrou, and S. Sekkat, “Job shop scheduling problem using genetic algorithms,” in Proceedings of the International Conference on Industrial Engineering and Operations Management, Rome, Europe: IEOM Society International, Jul. 2022, pp. 3050–3062. doi: 10.46254/EU05.20220592.
Abdullah, W. N., “Solving job-shop scheduling problem using a developed particle swarm optimization algorithm,” International Journal of Science and Research, vol. 7 no.1, pp. 1845-1848, 2018. doi: 10.21275/ART20179752.
Ben Ali, A. J. Telmoudi, and S. Gattoufi, “Stochastic cases of the dynamic job shop problem based on the genetic algorithm to minimize,” in 2017 4th International Conference on Control, Decision and Information Technologies, Barcelona, pp. 0760–0765, Apr. 2017, doi: 10.1109/CoDIT.2017.8102686.
Z. Shen and L. Smalov, “Comparative performance of genetic algorithm, simulated annealing and ant colony optimisation in solving the job-shop scheduling problem,” in 2018 26th International Conference on Systems Engineering, Sydney, Australia, pp. 1–5, Dec. 2018, doi: 10.1109/ICSENG.2018.8638185.
Janes, G., Perinic, M., & Jurkovic, Z., “Applying improved genetic algorithm for solving job shop scheduling problems,” Technical gazatte, vol. 24, no. 4, pp. 1243-1247, Aug. 2017, doi: 10.17559/TV-20150527133957.
A. Salido, J. Escamilla, A. Giret, and F. Barber, “A genetic algorithm for energy-efficiency in job-shop scheduling,” International journal of advanced manufacturing & technology, vol. 85, no. 5–8, pp. 1303–1314, Jul. 2016, doi: 10.1007/s00170-015-7987-0.
Zhang, Y. Hu, J. Sun, and W. Zhang, “An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints,” Swarm and Evolutionary Computation, vol. 54, pp. 100664, May 2020, doi: 10.1016/j.swevo.2020.100664.
Ç. Sel and A. Hamzadayı, “A simulated annealing approach based simulation-optimisation to the dynamic job-shop scheduling problem,” Pamukkale journal of engineering & science, vol. 24, no. 4, pp. 665–674, 2018, doi: 10.5505/pajes.2017.47108.
W. Zhang, J. B. Wen, Y. C. Zhu, and Y. Hu, “Multi-objective scheduling simulation of flexible job-shop based on multi-population genetic algorithm,” International journal of simulation model, vol. 16, no. 2, pp. 313–321, Jun. 2017, doi: 10.2507/IJSIMM16(2)CO6.
Zhang, B. Buchmeister, X. Li, and R. Ojstersek, “Advanced metaheuristic method for decision-making in a dynamic job shop scheduling environment,” Mathematics, vol. 9, no. 8, pp. 909, Apr. 2021, doi: 10.3390/math9080909.
R. Singh and S. S. Mahapatra, “A quantum behaved particle swarm optimization for flexible job shop scheduling,” Computers & Industrial Engineering, vol. 93, pp. 36–44, Mar. 2016, doi: 10.1016/j.cie.2015.12.004.
Z. Wang, J. Zhang, and S. Yang, “An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals,” Swarm and Evolutionary Computation, vol. 51, pp. 100594, Dec. 2019, doi: 10.1016/j.swevo.2019.100594.
C. Lin, Z. Cao, and M. Zhou, “Learning-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility,” IEEE Transactions on Cybernetics, vol. 53, no. 10, pp. 6663–6675, Oct. 2023, doi: 10.1109/TCYB.2022.3210228.
A. Y. Zebari, S. M. Almufti, and C. M. Abdulrahman, “Bat algorithm (BA): review, applications and modifications,” International Journal of Scientific World, vol. 8, no. 1, pp. 1–7, Jan. 2020, doi: 10.14419/ijsw.v8i1.30120.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
