Solving Multi-Objective Machine Scheduling Problem Using the Meerkat Clan Algorithm

Authors

  • Tahani jabbar Department of Mathematics College of Education for Pure Science (Ibn Al Haitham), University of ‎Baghdad, Baghdad, ‎ Iraq
  • Bayda Atiya Kalaf ‎ Department of Mathematics, College of Education for Pure Science (Ibn Al Haitham), University of ‎Baghdad, Baghdad, ‎ Iraq.
  • Erum Rehman Department of Mathematics School of social sciences, Nazarbayev University, Astana, Kazakhstan

DOI:

https://doi.org/10.33095/0ss7v861

Keywords:

Scheduling; Single machine; Multi-Objective; Branch and Bounded; Meerkat Clan

Abstract

Machine scheduling problems have become increasingly complex and dynamic. The complexity and size of the problems require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time. Therefore, this paper addresses to propose a new mathematical model for multi objective function based on Single-machine scheduling problems  by minimizing  the discounted total weighted completion time the number of tardy jobs the maximum earliness and the maximum weighted tardiness  with release date denoted   +  which are an NP-hard. To achieve efficient solutions, a metaheuristic method (Meerkat clan algorithm (MCA)) is used to solve the mathematical model and compare it with branch and bound (BAB) method. Computational results show that MCA provides efficient solutions in terms of accuracy and calculation speed compared to BAB. In addition, the BAB can solve up to 10 problems, while MCA can resolve problems up to 1000 for multi objective.

Downloads

Download data is not yet available.

Author Biography

  • Bayda Atiya Kalaf ‎, Department of Mathematics, College of Education for Pure Science (Ibn Al Haitham), University of ‎Baghdad, Baghdad, ‎ Iraq.

    Department mathematics

References

Abbas, I. T., & Ghayyib, M. N. (2024). Using Sensitivity Analysis in Linear Programming with Practical Physical Applications. Iraqi Journal of Science, 65(2), 907–922. https://doi.org/10.24996/ijs.2024.65.2.27

Abbass, D. A. (2019). Using Branch and Bound and Local Search Methods to Solve Multi-objective Machine Scheduling Problem. 1st International Scientific Conference of Computer and Applied Sciences, CAS 2019, 63–66.

https://doi.org/10.1109/CAS47993.2019.9075460

Abdul-Razaq, T. S., & Akram, A. O. (2018). Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem. Ibn AL-Haitham Journal for Pure and Applied Sciences, 436–451. https://doi.org/10.30526/2017.ihsciconf.1817

Ali, F. H., & Ahmed, M. G. (2020). Local Search Methods for Solving Total Completion Times, Range of Lateness and Maximum Tardiness Problem. Proceedings of the 6th International Engineering Conference “‘Sustainable Technology and Development’”, IEC 2020, 1, 103–108. https://doi.org/10.1109/IEC49899.2020.9122821

Amin, B. A., & Ramadan, A. M. (2021). Novel Heuristic Approach for Solving Multi-objective Scheduling Problems. Ibn AL- Haitham Journal for Pure and Applied Sciences, 34(3), 50–59. https://doi.org/10.30526/34.3.2677

Atiya, B., Bakheet, A. J. K., Abbas, I. T., Bakar, M. R. A., Soon, L. L., & Monsi, M. Bin. (2016). Application of simulated annealing to solve multi-objectives for aggregate production planning. AIP Conference Proceedings, 1739. https://doi.org/10.1063/1.4952566

Atiya Wardil, O., & Khaleel Ibrahim, S. (2024). The Bi-level Programming Approach to Improve the Inventory Control System with a Practical Application. Journal of Economics and Administrative Sciences, 30(142), 509-531. https://doi.org/10.33095/gd8dy062

Chachan, H. A., & Hameed, A. S. (2019). Exact methods for solving multi-objective problem on single machine scheduling. Iraqi Journal of Science, 60(8), 1802–1813.

https://doi.org/10.24996/ijs.2019.60.8.17

Chachan, H. A., & Jaafar, H. A. (2020). Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine. Ibn AL- Haitham Journal for Pure and Applied Sciences, 33(3), 140–157. https://doi.org/10.30526/33.3.2479

Costa, A., & Fernandez-Viagas, V. (2022). A modified harmony search for the T-single machine scheduling problem with variable and flexible maintenance. Expert Systems with Applications, 198(June 2021), 116897. https://doi.org/10.1016/j.eswa.2022.116897

Ezugwu, A. E. S. (2024). Metaheuristic Optimization for Sustainable Unrelated Parallel Machine Scheduling: A Concise Overview with a Proof-of-Concept Study. IEEE Access, 12(December 2023), 3386–3416. https://doi.org/10.1109/ACCESS.2023.3347047

Fakhruddin Saleh, H., Saad Khalaf, W., & Mohammed Abualrejal, H. (2024). CPM for Project Scheduling: Case Study in Karbala Metal Silo. Journal of Economics and Administrative Sciences, 30(139), 1–23. https://doi.org/10.33095/v4ry0989

Fasihi, M., Tavakkoli-Moghaddam, R., & Jolai, F. (2023). A bi-objective re-entrant permutation flow shop scheduling problem: minimizing the makespan and maximum tardiness. In Operational Research (Vol. 23, Issue 2). Springer Berlin Heidelberg.

https://doi.org/10.1007/s12351-023-00770-0

Forget, N., Gadegaard, S. L., & Nielsen, L. R. (2022). Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. European Journal of Operational Research, 302(3), 909–924.

https://doi.org/10.1016/j.ejor.2022.01.047

Hoogeveen, J. A. (1996). Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. Journal of Algorithms, 21(2), 415–433.

https://doi.org/10.1006/jagm.1996.0051

Kalaf, B. A., Nagham Muosa Neamah, & Khalifa, H. A. E.-W. (2024). Minimizing Total Completion Time, Total Earliness Time, and Maximum Tardiness for a Single Machine scheduling problem. Ibn AL-Haitham Journal for Pure and Applied Sciences, 37(1), 386–402. https://doi.org/10.30526/37.1.3094

Khraibet, T. J., & Ghafil, W. K. (2021). Using hybrid GA-PSO algorithm to solve problem in machine scheduling. Journal of Discrete Mathematical Sciences and Cryptography, 24(7), 2027–2035. https://doi.org/10.1080/09720529.2021.1958998

Mahnam, M., Moslehi, G., & Fatemi Ghomi, S. M. T. (2013). Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness. Mathematical and Computer Modelling, 57(9–10), 2549–2563. https://doi.org/10.1016/j.mcm.2013.01.007

Mohammadi, G., & Moaddabi, E. (2021). Using two metaheuristic algorithms for scheduling parallel machines with sequence dependent set- up times in job shop industries. https://doi.org/10.1080/00207721.2021.1913534

Moharam, R., Ali, A. F., Morsy, E., Ahmed, M. A., & Mostafa, M. M. (2022). A Discrete Chimp Optimization Algorithm for Minimizing Tardy / Lost Penalties on a Single Machine Scheduling Problem. IEEE Access, 10(May), 52126–52138.

https://doi.org/10.1109/ACCESS.2022.3174484

Neamah, N. M., & Kalaf, B. A. (2024a). Solving the Multi-Criteria Problem: Total Completion Time, Total Late Work, Total Earliness Time, Maximum Earliness, and Maximum Tardiness. Iraqi Journal of Science, 65(5), 2724–2735.

https://doi.org/10.24996/ijs.2024.65.5.30

Neamah, N. M., & Kalaf, B. A. (2024b). Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem. Iraqi Journal for Computer Science and Mathematics, 5(3), 14–25. https://doi.org/10.52866/ijcsm.2024.05.03.002

Neufeld, J. S., Schulz, S., & Buscher, U. (2023). A systematic review of multi-objective hybrid flow shop scheduling. European Journal of Operational Research, 309(1), 1–23. https://doi.org/10.1016/j.ejor.2022.08.009

Ragheb Abdulrazak Adlia*, A., & Hatim Mahmoud, A. (2024). The Role of Artificial Intelligence Techniques in Enhancing Project Completion Speed: A Study on Using LSTM Networks for Predicting Delay Times. Journal of Economics and Administrative Sciences, 30(142), 197–219. https://doi.org/10.33095/n7rfbg91

Sadiq Al-Obaidi, A. T., Abdullah, H. S., & Ahmed, Z. O. (2018). Solving flexible job shop scheduling problem using meerkat clan algorithm. Iraqi Journal of Science, 59(2A), 754–761. https://doi.org/10.24996/IJS.2018.59.2A.13

Saleh, M. Ab., & Sadiq, A. T. S. (2024). Modified Meerkat Clan Algorithm for Association Rules Mining. Baghdad Science Journal, 21(5), 1743. https://doi.org/10.21123/bsj.2023.8018

Shaker Salman*, M. (2024). A Linear Programming Method for Finding the Critical Path and the Desired Time to Complete the Project. Journal of Economics and Administrative Sciences, 30(142), 550–577. https://doi.org/10.33095/knc31b61

Shao, W., Shao, Z., & Pi, D. (2021). Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Systems with Applications, 183(August 2020), 115453.

https://doi.org/10.1016/j.eswa.2021.115453

Srinivasan, V., Boopathi, C. S., & Sridhar, R. (2021). A new meerkat optimization algorithm based maximum power point tracking for partially shaded photovoltaic system. Ain Shams Engineering Journal, 12(4), 3791–3802.

https://doi.org/10.1016/j.asej.2021.03.017

T’kindt, V., Della Croce, F., & Agnetis, A. (2024). Single machine adversarial bilevel scheduling problems. European Journal of Operational Research, 315(1), 63–72.

https://doi.org/10.1016/j.ejor.2023.11.018

Yin, J., Huang, R., Sun, H., & Cai, S. (2024). Multi-objective optimization for coordinated production and transportation in prefabricated construction with on-site lifting requirements. Computers and Industrial Engineering, 189(August 2023), 110017. https://doi.org/10.1016/j.cie.2024.110017

Yousif, S. F., & Ali, F. H. (2024). Solving Maximum Early Jobs Time and Range of Lateness Jobs Times Problem Using Exact and Heuristic Methods. Iraqi Journal of Science, 65(2), 923–937. https://doi.org/10.24996/ijs.2024.65.2.28

Zhang, E., Liu, M., Zheng, F., & Xu, Y. (2019). Single machine lot scheduling to minimize the total weighted (discounted) completion time. Information Processing Letters, 142, 46–51. https://doi.org/10.1016/j.ipl.2018.10.002

Downloads

Published

2025-06-01

Issue

Vol. 31 No. 147 (2025)

Section

Statistical Researches

License

Copyright (c) 2025 Journal of Economics and Administrative Sciences

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Articles submitted to the journal should not have been published before in their current or substantially similar form or be under consideration for publication with another journal. Please see JEAS originality guidelines for details. Use this in conjunction with the points below about references, before submission i.e. always attribute clearly using either indented text or quote marks as well as making use of the preferred Harvard style of formatting. Authors submitting articles for publication warrant that the work is not an infringement of any existing copyright and will indemnify the publisher against any breach of such warranty. For ease of dissemination and to ensure proper policing of use, papers and contributions become the legal copyright of the publisher unless otherwise agreed.

The editor may make use of Turnitin software for checking the originality of submissions received.

How to Cite

jabbar, T., Atiya Kalaf ‎, B. and Rehman , E. (2025) “Solving Multi-Objective Machine Scheduling Problem Using the Meerkat Clan Algorithm”, Journal of Economics and Administrative Sciences, 31(147), pp. 158–169. doi:10.33095/0ss7v861.

Similar Articles

1-10 of 357

You may also start an advanced similarity search for this article.