@article{8578004,
  abstract     = {{This paper deals with a real-life scheduling problem of a non-professional indoor football league. The goal is to develop a schedule for a time-relaxed, double round-robin tournament which avoids close successions of games involving the same team in a limited period of time. This scheduling problem is interesting, because games are not planned in rounds. Instead, each team provides time slots in which they can play a home game, and time slots in which they cannot play at all. We present an integer programming formulation and a heuristic based on tabu search. The core component of this algorithm consists of solving a transportation problem, which schedules (or reschedules) all home games of a team. Our heuristic generates schedules with a quality comparable to those found with IP solvers, however with considerably less computational effort. These schedules were approved by the league organizers, and used in practice for the seasons 2009-2010 till 2016-2017.}},
  author       = {{Van Bulck, David and Goossens, Dries and Spieksma, Frits C. R.}},
  issn         = {{0254-5330}},
  journal      = {{ANNALS OF OPERATIONS RESEARCH}},
  keywords     = {{Management Science and Operations Research,General Decision Sciences,Time-relaxed scheduling,Non-professional,Indoor football,Tabu search,OPERATIONS-RESEARCH,TOURNAMENT,ALGORITHM}},
  language     = {{eng}},
  number       = {{2}},
  pages        = {{715--730}},
  title        = {{Scheduling a non-professional indoor football league : a tabu search based approach}},
  url          = {{http://doi.org/10.1007/s10479-018-3013-x}},
  volume       = {{275}},
  year         = {{2019}},
}

Altmetric

View in Altmetric

Web of Science

Times cited: