Minimizing the maximum flow time in batch scheduling

详细信息    查看全文

• 作者：Sungjin Im^a ; ^{sim3@ucmerced.edu" class="auth_mail" title="E-mail the corresponding author} ; Hoon Oh^b ; ^{ho62@rutgers.edu" class="auth_mail" title="E-mail the corresponding author} ; Maryam Shadloo^a ; ^{mshadloo@ucmerced.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Batch scheduling ; Broadcast scheduling ; Maximum flow time ; Approximation ; Resource augmentation
• 刊名：Operations Research Letters
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：44
• 期：6
• 页码：784-789
• 全文大小：431 K

文摘

We consider the maximum flow time minimization problem in batch scheduling, which is a capacitated version of broadcast scheduling. In this setting, n$n$ different pages of information are available at the server which receives requests from clients over time for specific pages. The server can transmit at most one page p$p$ at each time to satisfy a batch of requests for the same page p$p$, up to a certain capacity B_p$B_p$. In this paper we give the first 1710056ef44986d856cda4ebf5bf" title="Click to view the MathML source">(1+ϵ)$(1+ϵ)$-approximations for this problem with arbitrarily small resource augmentation, using either more capacity or more speed.