Fairness in Repetitive Scheduling
Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael, Pinedo, Dvir Shabtay

TL;DR
This paper develops a unified framework for fair scheduling in repetitive environments, analyzing complexity and efficiency trade-offs to improve customer satisfaction in manufacturing and service industries.
Contribution
It introduces a comprehensive model for fair scheduling across multiple periods, analyzing problem complexity and the impact of fairness on system efficiency.
Findings
Classified the complexity of various fair scheduling problems.
Analyzed the trade-off between fairness and system efficiency.
Provided insights into the design of fair scheduling algorithms.
Abstract
Recent research found that fairness plays a key role in customer satisfaction. Therefore, many manufacturing and services industries have become aware of the need to treat customers fairly. Still, there is a huge lack of models that enable industries to make operational decisions fairly, such as a fair scheduling of the customers' jobs. Our main aim in this research is to provide a unified framework to enable schedulers making fair decisions in repetitive scheduling environments. For doing so, we consider a set of repetitive scheduling problems involving a set of clients. In each out of consecutive operational periods (e.g. days), each one of the customers submits a job for processing by an operational system. The scheduler's aim is to provide a schedule for each of the periods such that the quality of service (QoS) received by each of the clients will meet a certain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms
