Name
Abstract | ||
|---|---|---|
AbstractJob shop scheduling problem is an NP-hard problem. This paper proposes a new hybrid genetic algorithm to solve the problem in an appropriate way. In this paper, a new selection criterion to tackle premature convergence problem is introduced. To make full use of the problem itself, a new crossover based on the machines is designed. Furthermore, a new local search is designed which can improve the local search ability of proposed GA. This new approach is run on the some problems and computer simulation shows the effectiveness of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1504/ijaip.2020.107012 | Periodicals |
DocType | Volume | Issue |
Journal | 16 | 2 |
ISSN | Citations | PageRank |
1755-0386 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marjan Kuchaki Rafsanjani | 1 | 76 | 16.18 |
| Milad Riyahi | 2 | 0 | 0.34 |