Fair Allocation with Interval Scheduling Constraints

We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by agents. Each job is associated with release time, deadline and processing time such that it can be processed if its complete processing period is between its release time and deadline. The machines gain possibly different utilities by processing different jobs, and all jobs assigned to the same machine should be processed without overlap. We consider two widely studied solution concepts, namely, maximin share fairness and envy-freeness. For both criteria, we discuss the extent to which fair allocations exist and present constant approximation algorithms for various settings.

[1]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[2]  Silvio Lattanzi,et al.  Fair Clustering Through Fairlets , 2018, NIPS.

[3]  Mohammad Ghodsi,et al.  Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[6]  Magnus Lie Hetland,et al.  Fair Allocation of Conflicting Items , 2022, Auton. Agents Multi Agent Syst..

[7]  Eric Rice,et al.  Exploring Algorithmic Fairness in Robust Graph Covering Problems , 2020, NeurIPS.

[8]  Piotr Berman,et al.  Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..

[9]  Sanjoy K. Baruah,et al.  Fairness in periodic real-time scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[10]  Yuval Rabani,et al.  Fairness in scheduling , 1995, SODA '95.

[11]  Evangelos Markakis,et al.  Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.

[12]  Uriel Feige,et al.  A tight negative example for MMS fair allocations , 2021, WINE.

[13]  Martin Milanic,et al.  Fair Packing of Independent Sets , 2020, IWOCA.

[14]  Jie Zhang,et al.  Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning , 2020, NeurIPS.

[15]  Stefano Leonardi,et al.  Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint , 2020, NeurIPS.

[16]  Rohan R. Paleja,et al.  Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations , 2019, NeurIPS.

[17]  Erel Segal-Halevi,et al.  On Fair Division under Heterogeneous Matroid Constraints , 2020, AAAI.

[18]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[19]  Google,et al.  Improving Online Algorithms via ML Predictions , 2024, NeurIPS.

[20]  Siddharth Barman,et al.  Fair Division Under Cardinality Constraints , 2018, IJCAI.

[21]  Ariel D. Procaccia,et al.  Fair enough: guaranteeing approximate maximin shares , 2014, EC.

[22]  Benjamin Moseley,et al.  Fair Scheduling via Iterative Quasi-Uniform Sampling , 2017, SODA.

[23]  Éva Tardos,et al.  Algorithm design , 2005 .

[24]  Jugal Garg,et al.  An Improved Approximation Algorithm for Maximin Shares , 2019, EC.

[25]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[26]  Sanjoy K. Baruah,et al.  Pfair Scheduling of Generalized Pinwheel Task Systems , 1998, IEEE Trans. Computers.

[27]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[28]  Rohit Vaish,et al.  Finding Fair and Efficient Allocations , 2017, EC.

[29]  Maciej Drozdowski,et al.  Scheduling for Parallel Processing , 2009, Computer Communications and Networks.

[30]  Benjamin Moseley,et al.  Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization , 2020, SIAM J. Discret. Math..

[31]  Siddharth Barman,et al.  Approximation Algorithms for Maximin Fair Division , 2017, EC.

[32]  Kamesh Munagala,et al.  Proportionally Fair Clustering , 2019, ICML.

[33]  Jiarui Gan,et al.  Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free , 2020, ArXiv.

[34]  Anwar Saif,et al.  Task scheduling in cloud computing based on metaheuristic techniques: A review paper , 2020, EAI Endorsed Trans. Cloud Syst..

[35]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[36]  Siddharth Barman,et al.  Matroid Constrained Fair Allocation Problem , 2019, AAAI.