Field Scheduling

The field scheduling problem that we are considering is a combination of several problems. The goal is to schedule a round robin tournament that minimizes the travel cost of teams to fields. Each team and each field is considered to be at a single point in 2-space. The cost of a game is the sum of the distances of each of the two teams involved to the field where the game takes place.

The problem can be further specified:

• Each field can be used for at most one game per day.
• Each team must play each other team exactly once in the tournament.
• The tournament must be completed in the smallest number of days possible. This is equal to the ceiling of n(n-1)/2m, where n is the number of teams and m is the number of fields.