This topic focuses on how to solve the Job Shop scheduling problem through the Genetic Algorithm (GA) and the Nondominated Sorting Genetic Algorithm II (NSGA-II). At first, we will introduce the concept of GA and NSGA-II first, and finally implement and explain through Python.
Choose a section to move
Update time | Article |
---|---|
2018 | Genetic Algorithm (GA) |
2018 | Nondominated Sorting Genetic Algorithm II (NSGA-II) |
Update time | Article | Link |
---|---|---|
2018 | GA For Flow Shop | Documentation / Example / code / Folder |
2018 | GA For Job Shop | Documentation / Example / code / Folder |
2018 | NSGA-II | Documentation / Example / code / Folder |