| Article ID: | iaor201111641 |
| Volume: | 14 |
| Issue: | 6 |
| Start Page Number: | 655 |
| End Page Number: | 667 |
| Publication Date: | Dec 2011 |
| Journal: | Journal of Scheduling |
| Authors: | Ribeiro C, Guedes B |
| Keywords: | combinatorial optimization, programming: integer, heuristics: local search |
The carry‐over effects value is one of the various measures one can consider to assess the quality of a round robin tournament schedule. We introduce and discuss a new, weighted variant of the minimum carry‐over effects value problem. The problem is formulated by integer programming and an algorithm based on the hybridization of the Iterated Local Search metaheuristic with a multistart strategy is proposed. Numerical results are presented.