Home
Project Description:
This project is about developing a branch-and-bound type algorithm that solves the above described scheduling problem optimally for small input graphs. To achieve the highest possible performance, you also need to parallelize this branch-and-bound algorithm so that it itself uses multiple processors to speed up the search.
Group Members:
- Gargi Bansal
- Jainal Gandhi
- Harman Lamba
- Eric Leung
- Preet Patel
- Salma Sanad