GitHub / SleekPanther / load-balancing-problem-approximation-algorithm
Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fload-balancing-problem-approximation-algorithm
PURL: pkg:github/SleekPanther/load-balancing-problem-approximation-algorithm
Stars: 4
Forks: 1
Open issues: 0
License: None
Language: Java
Size: 388 KB
Dependencies parsed at: Pending
Created at: about 8 years ago
Updated at: over 1 year ago
Pushed at: about 8 years ago
Last synced at: 4 months ago
Topics: algorithm-design, algorithms, approximation, approximation-algorithms, balance, cpu, jobs, load, load-balancing, load-balancing-problem, machine, makespan, noah, noah-patullo, pattullo, pattulo, patullo, patulo, priority-queue, processing