Hybrid Genetic Simulated Annealing Algorithm for Job Shop Scheduling Problem
DOI:
https://doi.org/10.37376/sjuob.v33i2.264Keywords:
simulated annealing, genetic algorithm, hybrid algorithm, makespan, Job shop schedulingAbstract
The job shop scheduling problem (JSSP) is a well-known difficult combinatorial optimization problem, as it is classified as NP-hard problem and therefore no deterministic algorithms can solve them in a reasonable amount of time. The main objective of solving this problem is to find suitable job sequences on machines to optimize the performance criteria. In this paper, a meta-heuristic approach for solving the job-shop scheduling problem (JSSP) is presented. This approach uses a hybrid genetic algorithm that is suggested by previous stuody, to generate the best solutions and then a simulated annealing algorithm to improve the quality and performance of the best solutions to produce the optimal/near-optimal solution. Ten benchmark problems adopted from the previous study are used to evaluate the performance of the proposed algorithm. The computational results validate the quality of the proposed algorithm; this is done by calculating the completion time Cmax
Downloads
![Hybrid Genetic Simulated Annealing Algorithm for Job Shop Scheduling Problem](https://journals.uob.edu.ly/public/journals/1/article_264_cover_en_US.png)
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc-nd/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.