Optimization project
Optim-Flowshop
A C++ and Qt application for comparing exact methods, heuristics, and metaheuristics for permutation flowshop scheduling.
Implementation
I implemented branch and bound, CDS, NEH, Chen, simulated annealing, tabu search, and genetic search in C++. OpenMP supports parallel search.
The Qt interface loads benchmark instances and compares makespan and runtime. Python notebooks support the experiments.
Code on GitHub ↗CONTACT
Contact
You can email me about my research or a possible collaboration.