The challenge Algorithm for Optimal Job Scheduling and Task Allocation under Constraints has come to an end. Baseline algorithm was outperformed over 4-fold! Six teams achieved the same best score, which attests to the greatest skills of contestants, able to reach the hardest limit of what was possible for this task. In the case of a tie, earlier date of submission decides upon ranking of solutions. Thus, the winners are:
Runner-ups, who achieved the same score, but with a later submission date, are:
Full results can be viewed at the Leaderboard.
Two winning solutions are published now and are available with source code on GNU GPL license. See: