arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.18546cs.DS
收藏

加权主席分配与流程时间调度

Weighted Chairman Assignment and Flow-Time Scheduling

Tepper School of Business, Carnegie Mellon University(卡内基梅隆大学泰珀商学院);Microsoft Research(微软研究院)

Siyue Liu, Victor Reis

AI总结:

本文提出了一种加权主席分配算法,并解决了具有发布时间和关闭时间的调度问题,给出了最大流时间最小化问题的3近似算法。

摘要:

给定正整数 $m, n$,一个分数分配 $x \in [0,1]^{m \times n}$ 和权重 $d \in \mathbb{R}^n_{>0}$,我们证明存在一个分配 $y \in \{0,1\}^{m \times n}$,使得对于每一个 $i\in[m]$ 和 $t\in [n]$,$$ \Big|\sum_{j \in [t]} d_j (x_{ij} - y_{ij}) \Big| < \max_{j \in [n]} d_j. $$ 这个结果推广了Tijdeman (1973)关于无权重版本的结果,即所谓的主席分配问题。此外,这也验证了Morell和Skutella (IPCO 2020)提出的单源不可分割流猜想的特殊情况,该猜想涉及弧状的下界和上界。作为应用,我们考虑一个调度问题,其中作业有发布时间,机器有关闭时间,一个作业只能在机器关闭前被安排在机器上。我们给出了最大流时间最小化问题的3近似算法。

英文摘要:

Given positive integers $m, n$, a fractional assignment $x \in [0,1]^{m \times n}$ and weights $d \in \mathbb{R}^n_{>0}$, we show that there exists an assignment $y \in \{0,1\}^{m \times n}$ so that for every $i\in[m]$ and $t\in [n]$, \[ \Big|\sum_{j \in [t]} d_j (x_{ij} - y_{ij}) \Big| < \max_{j \in [n]} d_j. \] This generalizes a result of Tijdeman (1973) on the unweighted version, known as the chairman assignment problem. This also confirms a special case of the single-source unsplittable flow conjecture with arc-wise lower and upper bounds due to Morell and Skutella (IPCO 2020). As an application, we consider a scheduling problem where jobs have release times and machines have closing times, and a job can only be scheduled on a machine if it is released before the machine closes. We give a $3$-approximation algorithm for maximum flow-time minimization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑