Minimization Makespan Problem With an Aging Effect Based on Improved Arithmetic Optimization Algorithms on Job Shop Machines

Authors

  • Tian-Meng Gan Chongqing College of Architecture and Technology, Chongqing Shapingba, 400030, China
  • Xin-Gong Zhang College of Mathematics Science, Chongqing Normal University, Chongqing, China
  • Win-Chin Lin Department of Statistics, Feng Chia University, Taichung, 40724, Taiwan https://orcid.org/0000-0001-8237-8020
  • Chin-Chia Wu Department of Statistics, Feng Chia University, Taichung, 40724, Taiwan https://orcid.org/0000-0002-1598-5127

DOI:

https://doi.org/10.26713/cma.v16i3.3087

Keywords:

Arithmetic Optimization Algorithm, Job-shop scheduling problems, Greedy decoding algorithm, Aging effect, Release time

Abstract

The research delves into optimizing the Job Shop Scheduling Problem (JSSP) by considering aging effects and release time. This paper introduces an Advanced Arithmetic Optimization Algorithm (IAOA) designed specifically to minimize the makespan. IAOA operates by translating the continuous solution space into the discrete realm of JSSP through ROV transformation rules. It encodes and decodes the job shop problem using an insertion greedy decoding algorithm. To refine the conventional Arithmetic Optimization Algorithm (AOA), this study introduces a nonlinear Mathematical Acceleration Function (MOA) along with six neighborhood search strategies. Evaluating its performance involved a comparison of IAOA against AOA, Grey Wolf Optimizer (GWO), and Arithmetic Trigonometric Optimization Algorithm (ATOA) across 33 benchmark problems. The experimental results underscore IAOA’s superior optimization efficacy and its ability to converge efficiently when dealing with JSSP. Notably, IAOA successfully mitigates AOA’s limitations, particularly in achieving higher solution accuracy and faster convergence speed.

Downloads

Download data is not yet available.

References

L. Abualigah, K. H. Almotairi, M. A. Elaziz, M. Shehab and M. Altalhi, Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering, Engineering Analysis with Boundary Elements 138 (2022), 13 – 29, DOI: 10.1016/j.enganabound.2022.01.014.

L. Abualigah, A. Diabat, S. Mirjalili, M. A. Elaziz and A. H. Gandomi, The arithmetic optimization algorithm, Computer Methods in Applied Mechanics and Engineering 376 (2021), 113609, DOI: 10.1016/j.cma.2020.113609.

P. A. M. Devan, F. A. Hussin, R. B. Ibrahim, K. Bingi, M. Nagarajapandian and M. Assaad, An arithmetic-trigonometric optimization algorithm with application for control of real-time pressure process plant, Sensors 22(2) (2022), 617, DOI: 10.3390/s22020617.

A. H. A. Elkasem, M. Khamies, G. Magdy, I. B. M. Taha and S. Kamel, Frequency stability of AC/DC interconnected power systems with wind energy using arithmetic optimization algorithm-based fuzzy-PID controller, Sustainability 13(21) (2021), 12095, DOI: 10.3390/su132112095.

D. Gürses, S. Bureerat, S. M. Sait and A. R. Yildiz, Comparison of the arithmetic optimization algorithm, the slime mold optimization algorithm, the marine predators algorithm, the salp swarm algorithm for real-world engineering applications, Materials Testing 63(5) (2021), 448 – 452, DOI: 10.1515/mt-2020-0076.

M. Kharrich, L. Abualigah, S. Kamel, H. AbdEl-Sattar and M. Tostado-Véliz, An Improved Arithmetic Optimization Algorithm for design of a microgrid with energy storage system: Case study of El Kharga Oasis, Egypt, Journal of Energy Storage 51 (2022), 104343, DOI: 10.1016/j.est.2022.104343.

B. Liu, L. Wang and Y.-H. Jin, An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 37(1) (2007), 18 – 27, DOI: 10.1109/TSMCB.2006.883272.

H. Liu, X. Zhang, H. Zhang, C. Li and Z. Chen, A reinforcement learning-based hybrid Aquila Optimizer and improved Arithmetic Optimization Algorithm for global optimization, Expert Systems with Applications 224 (2023), 119898, DOI: 10.1016/j.eswa.2023.119898.

S. Luo, Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning, Applied Soft Computing 91 (2020), 106208, DOI: 10.1016/j.asoc.2020.106208.

J. Park, J. Chun, S. H. Kim, Y. Kim and J. Park, Learning to schedule job-shop problems: Representation and policy learning using graph neural network and reinforcement learning, International Journal of Production Research 59(11) (2021), 3360 – 3377, DOI: 10.1080/00207543.2020.1870013.

M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer Cham., xx + 670 pages (2016), DOI: 10.1007/978-3-319-26580-3.

M. A. Salido, J. Escamilla, F. Barber, A. Giret, D. Tang and M. Dai, Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems, Artificial Intelligence for Engineering Design, Analysis and Manufacturing 30(3) (2016), 300 – 312, DOI: 10.1017/S0890060415000335.

M. D. Toksari and B. Atalay, Some scheduling problems with job rejection and a learning effect, The Computer Journal 66(4) (2023), 866 – 872, DOI: 10.1093/comjnl/bxab201.

H. Wang and Y. Mo, Adaptive hybrid optimization algorithm for numerical computing in engineering applications, Engineering Optimization 57(4) (2025), 845 – 883, DOI: 10.1080/0305215X.2024.2337072.

R. Zhang, S. Song and C. Wu, A hybrid artificial bee colony algorithm for the job shop scheduling problem, International Journal of Production Economics 141(1) (2013), 167 – 178, DOI: 10.1016/j.ijpe.2012.03.035.

X. L. Zhao, Bicriteria due-window assignment and resource allocation scheduling with aging effect and a deteriorating rate-modifying activity, International Journal of Innovative Computing, Information and Control 20(4) (2024), 1169 – 1183, DOI: 10.24507/ijicic.20.04.1169.

Downloads

Published

30-10-2025
CITATION

How to Cite

Gan, T.-M. ., Zhang, X.-G., Lin, W.-C., & Wu, C.-C. (2025). Minimization Makespan Problem With an Aging Effect Based on Improved Arithmetic Optimization Algorithms on Job Shop Machines. Communications in Mathematics and Applications, 16(3), 879–893. https://doi.org/10.26713/cma.v16i3.3087

Issue

Vol. 16 No. 3 (2025)

Section

Research Article

License

Creative Commons Licence 4.0 by  

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.