In this paper, we explore how a natural generalization of Shortest Remaining Processing Time (SRPT) can be a powerful \emph{meta-algorithm} for online scheduling. The meta-algorithm processes jobs to maximally reduce the objective of the corresponding offline scheduling problem of the remaining jobs: minimizing the total weighted completion time of them (the residual optimum). We show that it achieves scalability for minimizing total weighted flow time when the residual optimum exhibits \emph{supermodularity}. Scalability here means it is $O(1)$-competitive with an arbitrarily small speed augmentation advantage over the adversary, representing the best possible outcome achievable for various scheduling problems.
Thanks to this finding, our approach does not require the residual optimum to have a closed mathematical form. Consequently, we can obtain the schedule by solving a linear program, which makes our approach readily applicable to a rich body of applications. Furthermore, by establishing a novel connection to \emph{substitute valuations in Walrasian markets}, we show how to achieve supermodularity, thereby obtaining scalable algorithms for various scheduling problems, such as matroid scheduling, generalized network flow, and generalized arbitrary speed-up curves, etc., and this is the \emph{first} non-trivial or scalable algorithm for many of them.
A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model
最小化完工时间的同类机在线排序问题一直是文献研究的热点。在联机调度中,调度程序逐个接收作业列表,并在下一个作业到达之前将每个传入作业动态地分配给其中一台机器。在本文中,我们研究了一个变种的在线调度问题,其中要求从k个不同的来源飞行作业。同时到达的工作从多个来源,这是一个不平凡的研究挑战,以确保公平的调度相对于不同的来源,同时优化的整体完工时间表。本文提出了一种新的多列表调度模型(MLS),并基于该模型提出了一种2-竞争确定性在线算法LJLLM(Largest Job on Least Loaded Machine)。
A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree
研究了在一组相同的并行处理机上以最小化完工时间为目标的独立工件列表的非抢占式调度问题的计算复杂性。通过定义\textit{Scheduling Solution Space Tree (SSST)}的数据结构,我们首次尝试探索显示问题的穷举解空间的组合结构。的\textit{SSST}的属性被正式定义,并通过我们的分析结果的特点。我们开发了一种独特的技术来显示使用SSST和\textit{Weighted Scheduling Solution Space Tree (WSSST)}数据结构的问题$\mathcal{NP}$。我们设计了第一个非确定性多项式时间算法\textit{Magic Scheduling (MS)}的基础上减少框架的问题。我们还定义了一个新的变种,多处理器调度包括用户作为一个额外的输入参数。我们正式建立的复杂性类的变体的归约原则。最后,我们通过探讨未来研究调查的几个有趣的开放性问题来结束本文。