1 citations · 5 across the 11 of their papers we have counts for
4 papers · 1 filter
Finding Fair Draws for Incomplete Round Robin Tournaments
Sten Wessel, Frits Spieksma
In an incomplete round robin tournament, teams play against different sets of opponents. Given varying strengths of the teams, this raises a fairness issue. We establish the comple…
Scheduling jobs that change over time
Roel Lambers, Rudi Pendavingh, Frits Spieksma +1
We consider a 1-machine scheduling problem where the temperature of a job rises during processing, and cools down when not being processed according to given linear heating and coo…
Fairness in Graph-Theoretical Optimization Problems
Christopher Hojny, Frits Spieksma, Sten Wessel
There is arbitrariness in optimum solutions of graph-theoretic problems that can give rise to unfairness. Incorporating fairness in such problems, however, can be done in multiple…
Integer Programming Models for Round Robin Tournaments
Jasper van Doornmalen, Christopher Hojny, Roel Lambers +1
Round robin tournaments are omnipresent in sport competitions and beyond. We propose two new integer programming formulations for scheduling a round robin tournament, one of which…