Fair Scheduling for Time-dependent Resources

We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by intellectual 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.

Authors

• Bo Li Department of Computing, The Hong Kong Polytechnic University
• Minming Li City University of Hong Kong
• Ruilong Zhang Department of Computer Science, City University of Hong Kong (Dongguan)

Keywords

No keywords are indexed for this paper.