Fairness in repetitive scheduling

Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael L. Pinedo, Dvir Shabtay

Abstract: Highlights•New framework for modeling repetitive scheduling problems with fairness criteria.•The goal is to provide solutions where the worst quality of service is under control.•Analysis of three fairness criteria derived from standard objective functions.•Focus on classical and parameterized complexity classification and algorithm design.•Introduction of the price of fairness to the area of repetitive scheduling.