Using Local Search Methods for Solving Two Multi-Criteria Machine Scheduling Problems
DOI:
https://doi.org/10.23851/mjs.v34i4.1430Keywords:
Local search Methods, Multi-Criteria Scheduling Problems, Bees Algorithm, Simulated Annealing, Branch and Bound MethodAbstract
In this paper, we have improved solutions for two of the Multi-Criteria Machine Scheduling Problems (MCMSP). These problems are to maximize early jobs time and range of lateness jobs times (1//(E_max,R_L ), and the second problem is maximum tardy jobs time and range of lateness jobs times (1//(T_max,R_L ) in a single machine with Multi-Objective Machine Scheduling Problems (MOMSP) 1//(E_max+R_L ) and 1//(T_max+R_L ) which are derived from the main problems respectively. The Local Search Methods (LSMs), Bees Algorithm (BA), and a Simulated Annealing (SA) are applied to solve all suggested problems. Finally, the experimental results of the LSMs are compared with the results of the Branch and Bound (BAB) method for a reasonable time. These results are ensuring the efficiency of LSMs.
Received: 12/06/2023
Revised: 23/06/2023, 22/07/2023
Accepted: 31/07/2023
Downloads
References
H. J. Mutashar, Flow Shop Scheduling Problems Using Exact and Local Search Methods, Baghdad: M.Sc. Thesis, Dept. of Mathematics, College of Science, Mustansiriyah University, 2008.
S. J. Ibraheem, Single Machine Multicriteria Scheduling, Baghdad: M. Sc. Thesis, Mathematics department, College of Ibn AL-Haitham, University of Baghdad, 2014.
A. A. Mahmood, "Local Search Algorithms for Multiobjective Scheduling Problem," Journal of Al Rafidain University College, no. 36, 2015.
S. B. Abdulkareem, Algorithms for Solving Multi-Criteria Scheduling Problems, Baghdad: Mathematics department, College of Science, Mustansiriyah University, 2017.
D. A. Abbass, "Using Branch and Bound and Local Search Methods to Solve Muiti-Objective Machine Scheduling Problem," in First International Conference of Computer and Applied Sciences(CAS), IEEE Xplore, 2019.
A. M. Gh, Exact and Approximation Methods for Solving Combinatorial Optimization Problems, Baghdad, Iraq.: Ph. D. Thesis, Mathematics department, College of Science, Mustansiriyah University, 2022.
G. A. Manal and F. H. Ali, "Optimal and Near Optimal Solutions for Multi Objective Function on a Single Machine," in 1st International Conference on Computer Science and Software Engineering (CSASE2020), Sponsored by IEEE Iraq Section, 16-17 Apr., Duhok, Kurdistan Region - Iraq, 2020.
S. F. Yousif and F. H. Ali, "Solving Maximum Early Jobs Time and Range of Lateness Jobs Times Problem Using Exact and Heuristic Methods," Iraqi Journal of Science, (accepted 2023), vol. 65, no. 2, 2024.
M. H. Ibrahim, Exact and Approximation Methods for Solving Machine Scheduling Problems with and without Setup Time, Baghdad: Ph. D. Thesis, Mathematics department, College of Science, Mustansiriyah University, 2022.
S. M. Jasim and F. H. Ali, "Exact and Local Search Methods for Solving Travelling Salesman Problem with Practical Application," Iraqi Journal of Science, [S.l], vol. 60, no. 5, pp. 1138-1153, 2019.
F. A. Ali, Improving Exact and Local Search Algorithms for Solving Some Combinatorial Optimization Problems, Baghdad: Ph. D. Thesis, Dept of Mathematics, College of Science, Al-Mustansiriyah University, 2015.
Downloads
Key Dates
Published
Issue
Section
License
Copyright (c) 2023 Al-Mustansiriyah Journal of Science
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Articles accepted for publication in Al-Mustansiriyah Journal of Science (MJS) are protected under the Creative Commons Attribution 4.0 International License (CC BY-NC). Authors of accepted articles are requested to sign a copyright release form prior to their article being published. All authors must agree to the submission, sign copyright release forms, and agree to be included in any correspondence between MJS and the authors before submitting a work to MJS. For personal or educational use, permission is given without charge to print or create digital copies of all or portions of a MJS article. However, copies must not be produced or distributed for monetary gain. It is necessary to respect the copyright of any parts of this work that are not owned by MJS.
How to Cite
