Approximate Local Search Methods for Multi-objective Sequencing Problem
DOI:
https://doi.org/10.24237/ASJ.02.02.718BKeywords:
Local search, multi-objective, sequencing, genetic algorithmAbstract
In the setting of a single machine, this study suggests approximation local search strategies to identify approximate solutions to the multi-objective sequencing problem, where the problem is the total of the four objectives: total completion time ∑Cj j= 1,….,n, total lateness ∑Lj, maximum lateness Lmax and maximum earliness Emax. Descent Method (DM), Simulated Annealing (SA), and genetic algorithm (GA) are three approximate local search techniques that are computer-implemented Matlab programs. On the basis of the outcomes of computing tests, conclusions are modeled on the effectiveness of the local search techniques.
References
A. I. Khamees, Solving Multiobjective Sequencing Problem on one Machine,Thesis, University of Diyala, College of Science, Dept. of Mathematics, (2022)
A. A. M. Al-Nuaimi, Local Search Algorithms for Multiobjective Scheduling Problem, Journal of Al Rafidain University College, 36,201-217(2015)
P. Bruker, Scheduling algorithms, (Berlin-Heidelberg- New York, Springer, 2007)
M. Pinedo, Scheduling: theory, algorithms and systems, (New York: Springer, 2008)
T. Sen, S. K. Gupta, A branch and bound procedure to solving a bicriterion scheduling problem, IIE Transactions, 15,84-88(1983)
C. L. Chen, V. S. Vempati, N. Aljaber , An application of genetic algorithms for flow shop problems, European Journal of operation research, 80,389-396(1995)
A. S. Al-Tameemi, A. A. M. Al-Nuaimi, Exact and Local Search Algorithms to Minimize Multicriteria Scheduling Problem, Turkish Journal of computer and Mathematics Education, 12, (1) 7821-7831(2021)
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 CC BY 4.0
This work is licensed under a Creative Commons Attribution 4.0 International License.
