Fairness in Scheduling
From MaRDI portal
Recommendations
Cited in
(22)- Fair student placement
- Proportionate progress: A notion of fairness in resource allocation
- Optimizing carpool formation along high-occupancy vehicle lanes
- Optimization for dynamic ride-sharing: a review
- Balancing schedules using maximum leximin
- Comments on: ``An overview of curriculum-based course timetabling
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- Randomized allocation processes
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- The offline carpool problem revisited
- Fairness for dynamic control
- Bounding the errors for convex dynamics on one or more polytopes
- scientific article; zbMATH DE number 3901999 (Why is no real title available?)
- The \(k\)-server problem
- Carpooling in social networks
- On fairness in the carpool problem
- scientific article; zbMATH DE number 910905 (Why is no real title available?)
- A note on fairness measure for scheduling problems over unrelated machines
- Fair algorithm design: fair and efficacious machine scheduling
- Schedule situations and their cooperative game theoretic representations
- Optimizing fairness over time with homogeneous workers (short paper)
- Fairness in repetitive scheduling
This page was built for publication: Fairness in Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225867)