flowshop_scheduling_problem

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)

1. Install requirements

pip install flask plotly numpy

or Install using requirements.txt file

python -m pip install -r requirements.txt

Built With

1. Python 3
2. Flask
3. Plotly

TODO

1. Make Benchmarks' comparisons

License

This project is licensed under the MIT License - see the LICENSE.md file for details.