Fair Scheduling for Time-dependent Resources

Bo Li; Minming Li; Ruilong Zhang

Fair Scheduling for Time-dependent Resources

Bo Li
, Minming Li
, Ruilong Zhang^*

^*此作品的通讯作者

Hong Kong Polytechnic University
City University of Hong Kong

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

18 引用（Scopus）

摘要

We study a fair resource scheduling problem,nwhere 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.

源语言	英语
主期刊名	Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021
编辑	Marc'Aurelio Ranzato, Alina Beygelzimer, Yann Dauphin, Percy S. Liang, Jenn Wortman Vaughan
出版商	Neural information processing systems foundation
页	21744-21756
页数	13
ISBN（电子版）	9781713845393
出版状态	已出版 - 2021
已对外发布	是
活动	35th Conference on Neural Information Processing Systems, NeurIPS 2021 - Virtual, Online 期限: 6 12月 2021 → 14 12月 2021

出版系列

姓名	Advances in Neural Information Processing Systems
卷	26
ISSN（印刷版）	1049-5258

会议

会议	35th Conference on Neural Information Processing Systems, NeurIPS 2021
市	Virtual, Online
时期	6/12/21 → 14/12/21

其它文件与链接

链接到 Scopus 的出版物

引用此

Li, B., Li, M., & Zhang, R. (2021). Fair Scheduling for Time-dependent Resources. 在 MA. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, & J. Wortman Vaughan (编辑), Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021 (页码 21744-21756). (Advances in Neural Information Processing Systems; 卷 26). Neural information processing systems foundation.

Li, Bo ; Li, Minming ; Zhang, Ruilong. / Fair Scheduling for Time-dependent Resources. Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021. 编辑 / Marc'Aurelio Ranzato ; Alina Beygelzimer ; Yann Dauphin ; Percy S. Liang ; Jenn Wortman Vaughan. Neural information processing systems foundation, 2021. 页码 21744-21756 (Advances in Neural Information Processing Systems).

@inproceedings{0a79f880ce054e8aa7201b76cd35a28a,

title = "Fair Scheduling for Time-dependent Resources",

abstract = "We study a fair resource scheduling problem,nwhere 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.",

author = "Bo Li and Minming Li and Ruilong Zhang",

note = "Publisher Copyright: {\textcopyright} 2021 Neural information processing systems foundation. All rights reserved.; 35th Conference on Neural Information Processing Systems, NeurIPS 2021 ; Conference date: 06-12-2021 Through 14-12-2021",

year = "2021",

language = "英语",

series = "Advances in Neural Information Processing Systems",

publisher = "Neural information processing systems foundation",

pages = "21744--21756",

editor = "Marc'Aurelio Ranzato and Alina Beygelzimer and Yann Dauphin and Liang, \{Percy S.\} and \{Wortman Vaughan\}, Jenn",

booktitle = "Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021",

address = "美国",

}

Li, B, Li, M & Zhang, R 2021, Fair Scheduling for Time-dependent Resources. 在 MA Ranzato, A Beygelzimer, Y Dauphin, PS Liang & J Wortman Vaughan (编辑), Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021. Advances in Neural Information Processing Systems, 卷 26, Neural information processing systems foundation, 页码 21744-21756, 35th Conference on Neural Information Processing Systems, NeurIPS 2021, Virtual, Online, 6/12/21.

Fair Scheduling for Time-dependent Resources. / Li, Bo; Li, Minming ; Zhang, Ruilong.
Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021. 编辑 / Marc'Aurelio Ranzato; Alina Beygelzimer; Yann Dauphin; Percy S. Liang; Jenn Wortman Vaughan. Neural information processing systems foundation, 2021. 页码 21744-21756 (Advances in Neural Information Processing Systems; 卷 26).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

TY - GEN

T1 - Fair Scheduling for Time-dependent Resources

AU - Li, Bo

AU - Li, Minming

AU - Zhang, Ruilong

PY - 2021

Y1 - 2021

N2 - We study a fair resource scheduling problem,nwhere 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.

AB - We study a fair resource scheduling problem,nwhere 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.

UR - https://www.scopus.com/pages/publications/85130993714

M3 - 会议稿件

AN - SCOPUS:85130993714

T3 - Advances in Neural Information Processing Systems

SP - 21744

EP - 21756

BT - Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021

A2 - Ranzato, Marc'Aurelio

A2 - Beygelzimer, Alina

A2 - Dauphin, Yann

A2 - Liang, Percy S.

A2 - Wortman Vaughan, Jenn

PB - Neural information processing systems foundation

T2 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021

Y2 - 6 December 2021 through 14 December 2021

ER -

Li B, Li M , Zhang R. Fair Scheduling for Time-dependent Resources. 在 Ranzato MA, Beygelzimer A, Dauphin Y, Liang PS, Wortman Vaughan J, 编辑, Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021. Neural information processing systems foundation. 2021. 页码 21744-21756. (Advances in Neural Information Processing Systems).

Fair Scheduling for Time-dependent Resources

摘要

出版系列

会议

其它文件与链接

指纹

引用此