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:

1. Jure Žbontar, University of Ljubljana, Slovenia (jzbontar) - $1,000 award
2. Piotr Czerpak, University of Warmia and Mazury, Poland (kudlaty) - $500 award

Runner-ups, who achieved the same score, but with a later submission date, are:

• TEAM_CODeS, K.U. Leuven & KAHO Sint-Lieven
• Notissa
• Jannes Verstichel (yannisch), Kulak
• artem, University of Warmia and Mazury

Congratulations!

Full results can be viewed at the Leaderboard.

Winning Algorithms

Two winning solutions are published now and are available with source code on GNU GPL license. See:

1. Jure Žbontar's algorithm: description, source code, JAR (source and byte code).
2. Piotr Czerpak's algorithm: description, source code, JAR (source and byte code).