1.  Starts in february – one month to complete it.  Done it for seven years.  The schdule for 2009-2010 (the first year) was ”awful”.  In the first year we optimized the whole season in one phase.  Nowdays we split it into two parts (autumn and spring)

2.  Schduling is about minimizing some cost function.  The cost function is a mathematical formula consisting of the sum of products of constraint values and their weights.  The constraints are divided into hard and soft ones.  The hard ones must be satisfied.  The soft ones must be minimized.

3.  So actually the cost function consists of two parts: 1 = the hard value and 2 = the soft value.  In the end the hard value must equal zero and the soft value must be as small as possible.  An example of such a function: ∑ h i hw i + ∑s i sw i.

4.  The restrictions for the first year were reasonable.  Every year the restrictions have become more and more difficult to fulfill.  For example: Away tours: 10 games  76 games. Setted games (home team, away team or both): 5  83. Restrictions: 25  140.

5.  The constraints to be optimized: A team must play 0-1 times in a round (hard) Venue restrictions (hard) A team can not play more than 3 times during a week (hard) Local opponents must meet each other on Friday or Saturday (hard  soft) Breaks (soft) Ilves vs. Tappara (hard) and HIFK vs. Blues (soft) At least 3 weeks between games of same teams (soft)

6.  The constraints to...(continued): Every team should have the same amount of games played after each round (soft) Some games must be played after a certain round or before a certain round (soft) A team can not travel more than xxx km on the second consecutive game day (explain this)(soft). There should be an even distribution of the games on different weekdays (explain this)(soft).

7.  Some results: All hard constraints satisfied (excluding local opponents ). HIFK and Blues plays home on the same day 10 times. Travelling constraint: 5 faults. Difference in the amounts of played games: 3.

8.  So, why is the published schedule not so good?  Teams move their games!  ”A” has met ”B” already twice but ”C” not at all?  Why is it not possible to make a schdule where every team meets every other team in every quarter?  Why has ”A” allready played N games while ”B” has only played N-3 games?

9.  So, why is the published schedule not so good?  Teams move their games!  ”A” has met ”B” already twice but ”C” not at all?  Why is it not possible to make a schdule where every team meets every other team in every quarter?  Why has ”A” allready played N games while ”B” has only played N-3 games?

10. kv xx xxx x xxxxxx xx xxxxxx vkxx k x k x xv x x kxk xxkxk kxk kv kvkvkvvv vk x vkk vkvvvxvxkkzk vkkvkvvvkkvvkkvv kvkxkxvvkxkvvv kvxkxkxxvzvv kk vkvxvxvvkvv kvkvkvxvxvvxvxkvvkx kvkxkxvvvvkkvvvv k k x v k kvxvxkxkxkv x xxx xxxxxxxxxxxxxxkkvvkk