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.

翻译：我们研究的是公平资源时间安排问题,即将一组间隙工作分配给由代理控制的多种机器。每份工作都与发放时间、期限和处理时间相关,如果其完整的处理时间是在发放时间和期限之间,则可以处理。机器通过处理不同的工作获得不同的公用事业,分配给同一机器的所有工作都应在不出现重叠的情况下处理。我们考虑了两个经过广泛研究的解决方案概念,即:分享最大程度的公平性和无妒忌。关于这两个标准,我们讨论了公平分配的程度,并提出了各种环境的固定近似算法。