Neville-Loh/distributed-system-scheduler

A branch-and-bound, and A* type algorithm that solves the NP Hard Scheduling problem with the highest possible performance

Java