Fairness in Scheduling

DOI10.1006/jagm.1998.0953zbMath0917.68017OpenAlexW4236693084MaRDI QIDQ4225867

James Aspnes, Leonard J. Schulman, Moni Naor, Yuval Rabani, Miklós Ajtai, Orli Waarts

Publication date: 17 January 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0953

zbMATH Keywords

carpool problemon-line machine scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ The Offline Carpool Problem Revisited ⋮ The \(k\)-server problem ⋮ Randomized allocation processes ⋮ Optimization for dynamic ride-sharing: a review ⋮ Optimizing carpool formation along high-occupancy vehicle lanes ⋮ Bounding the errors for convex dynamics on one or more polytopes ⋮ Comments on: ``An overview of curriculum-based course timetabling

This page was built for publication: Fairness in Scheduling