Job-shop Scheduling Problem(JSP) is a typical NP-Hard problem, and there is no exact optimal solution algorithm. This paper analyzes the feasibility of two intelligent optimization algorithms, Hill-Climbing Algorithm and Simulated Annealing Algorithm, to solve JSP. What's more, we also propose some optimum proposals to these two algorithms to improve algorithm performance.
-
Notifications
You must be signed in to change notification settings - Fork 0
gmscofield/JSP-based-on-HC-and-SA-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published