A new neighborhood structure for round robin scheduling problems
From MaRDI portal
Publication:1651632
DOI10.1016/J.COR.2015.12.016zbMath1391.90276OpenAlexW2226415718MaRDI QIDQ1651632
Tiago Januario, Sebastián Urrutia
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.12.016
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Edge coloring: a natural model for sports scheduling ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Round-robin scheduling with regard to rest differences ⋮ Unnamed Item ⋮ Integrated break and carryover effect minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling in sports: an annotated bibliography
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- On perfect one-factorization of the complete graph \(K_{2p}\)
- A constructive proof of Vizing's theorem
- An ILS heuristic for the traveling tournament problem with predefined venues
- The traveling tournament problem with predefined venues
- Round robin scheduling -- a survey
- Scheduling in Sports
This page was built for publication: A new neighborhood structure for round robin scheduling problems