The FLOW-SHOP problem, an NP-HARD scheduling issue, challenges even the best algorithms for small-scale instances. This paper proposes three solutions: (1) Hill-climbing (2) Combining hill-climbing with simulated annealing as a metaheuristic (3) Utilizing genetic algorithms while attempting to optimize them by incorporating hill-climbing.
active 2023-09-03 → 2024-04-19 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 230 days from 2023-09-03 to 2024-04-19. Pushes: 4 total, peak 4 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 2 total, peak 1 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Ruiqin-Huang | 4 | 4 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 2 stars here means stars gained during the window, not the repo's star count.