flowshop_scheduling_problem

flowshopschedulingproblem This is an implemention for some algorithms to solve a Permutation Flowshop Scheduling Problem (PFSP) using exact methods (Johnson's Rule, Branch And Bound) and Heuristic algorithms (Palmer, CDS, NEH) and genetic algorithm. NOTE Not all algorithms are implemented in this repo. Until now, only johnson's algorithm, Palmer's heuristic, CDS and NEH heuristic are implemented. Deployment A python virtual environement is strongly advised (Optional) Install requirements or Install using requirements.txt file Built With Python 3 Flask Plotly TODO Make Benchmarks' comparisons License This project is licensed under the MIT License - see the LICENSE.md file for details.