This is solution resolving Task Scheduling Problem using optimized metaheuristics.
P||Cmax is problem of finding optimal(minimal) time needed to complete set of indivisible tasks on given number of identical processors.
Simple approximate greedy algorithm takes tasks in order and puts them in processors with shortest working time.
Statistically better approximation is given by Longest Tasks First (LTF) algorithm, though it requires sorting task set before scheduling.
This solution uses metaheuristics called Simulated Annealing. This simple in it's assumptions technique allows us to