We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Using Local Search Methods for Solving Two Multi-Criteria Machine Scheduling Problems.
- Authors
Yousif, Safanah Faisal; Ali, Faez Hassan; Alshaikhli, Karrar Fatah
- Abstract
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// (Emax, RL)), and the second problem is maximum tardy jobs time and range of lateness jobs times 1//(Tmax, RL) in a single machine with Multi- Objective Machine Scheduling Problems (MOMSP) 1// (Emax, RL) and 1// (Tmax, RL) 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.
- Subjects
BEES algorithm; SIMULATED annealing; SCHEDULING; TARDINESS; MACHINERY
- Publication
Al-Mustansiriyah Journal of Science, 2023, Vol 34, Issue 4, p96
- ISSN
1814-635X
- Publication type
Article
- DOI
10.23851/mjs.v34i4.1430