Solving bi-criteria of total earliness times jobs and range of lateness machine scheduling problems by using local search methods

Wadhah Abdulelah Hussein; Faez Hassan Ali; Zeyad M. Abdullah

doi:10.5269/bspm.80725

Wadhah Abdulelah Hussein Department of Mathematics, College of Computer Science and Mathematics, Tikrit University, Tikrit, Iraq
Faez Hassan Ali
Zeyad M. Abdullah

Resumen

In this paper, two different local search methods (LSMs) have been investigated in this work to solve the bi-criteria 1//(\sum Ej, RL) and bi-objective 1//(\sum Ej + RL) problems. The used LSMs are Bees Algorithm (BA) and Genetic Algorithm (GA), which are effective heuristic approaches. We are comparing the results of the two LSMs with the results of exact methods like Branch and Bound. In terms of optimal solutions and CPU time, this work demonstrates the strong performance of BA and GA when compared to exact and heuristic approaches

Descargas

La descarga de datos todavía no está disponible.

Citas

Abbass, Doha A., Using Branch and Bound and Local Search Methods to Solve Multi-Objective Machine Scheduling Problem, in First International Conference of Computer and Applied Sciences (CAS), IEEE Xplore, (2019).

Faez, Hassan A.; Manal, Ghassan A., Local Search Methods for Solving Total Completion Times, Range of Lateness and Maximum Tardiness Problem, in 6th International Engineering Conference Sustainable Technology and Development (IEC-2020), Erbil, Iraq.

Faez, Hassan A.; Riyam, N. J.; Wadhah, A. H., Solving Bi-Criteria and Bi-Objectives of Total Tardiness Jobs Times and Range of Lateness Problems Using New Techniques, AI-Mustansiriyah Journal of Science 33(2), 27-35, (2022).

Faez, Hassan A.; Rasha J. M. and Wadhah A. H., Exact and Near Pareto Optimal Solutions for Total Completion Time and Total Late Work Problem, Iraqi Journal of Science 64(7), 4385-4398, (2023).

Faez, H. A.; Wadhah A. H., The heuristic and metaheuristic methods to minimize the total completion and total tardiness jobs times problem, International Journal of Nonlinear Analysis and Applications 13(2), 2025-2035, (2022).

Jasim, Sajjad M.; Faez, H. A., Exact and Local Search Methods for Solving Travelling Salesman Problem with Practical Application, Iraqi Journal of Science 60(5), 1138-1153, (2019).

Manal, G. A.; Faez, H. A., The Best Efficient Solutions for Multi-Criteria Travelling Salesman Problem Using Local Search Methods, Iraqi Journal of Science 63(10), 4352-4360, (2022).

Manal, G. A.; Faez, H. A.; Hanan, A. C., Solving Multi Objectives function problem using branch and bound and local search methods, International Journal of Nonlinear Analysis and Applications 13(1), 1619-1658, (2022).

Safanah, F. Y.; Faez, H. A., 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, (2024).

Safanah, F. Y.; Faez, H. H.; Karrar, F. A., Using local search methods for solving two multi-criteria machine scheduling problems, Al-Mustansiriyah Journal of Science 34(4), (2023).

Safanah, F. Y., New Methods for Solving Combinatorial Optimization Problems, M.Sc. Thesis, Mustansiriyah University, College of Science, Department of Mathematics Science, (2023).

Sajah, J. I., Single Machine Multicriteria Scheduling, M.Sc. Thesis, Mathematics Department, College of Ibn ALHaitham, University of Baghdad, (2014).

Shermeen, B. A., Algorithms for Solving Multi-Criteria Scheduling Problems, M.Sc. Thesis, Baghdad: Mathematics Department, College of Science, Mustansiriyah University, (2017).

Wadhah, A. H.; Zeyad, M. A.; Faez, H. A., Solving Bi-Criteria of Total Earliness Jobs Times and Range of Lateness Problems by using Local Search Methods, Al-Nahrain Journal of Science, (accepted 2025).

Zeyad, M. A. et al., A New Shifted Conjugate Gradient Method Based on Shifted Quasi-Newton Condition, Journal of Physics: Conference Series 1818, 012-105, (2021).

Zeyad, M. A. et al., Modification of the new conjugate gradient algorithm to solve nonlinear fuzzy equations, Indonesian Journal of Electrical Engineering and Computer Science 27(3), 1525-1532, (2022).