Incremental Ordering for Scheduling Problems
Keywords: Incremental Sorting, Enumeration, Precedence Constraints, Topological Ordering
TL;DR: We study the concept of computing first solution parts to core scheduling problems.
Abstract: Given an instance of a scheduling problem where we want to start executing jobs as soon as possible, it is advantageous if a scheduling algorithm emits the first parts of its solution early, in particular before the algorithm completes its work.
Therefore, in this position paper, we analyze core scheduling problems in regards to their enumeration complexity, i.e. the computation time to the first emitted schedule entry (preprocessing time) and the worst case time between two consecutive parts of the solution (delay).
Specifically, we look at scheduling instances that reduce to ordering problems.
We apply a known incremental sorting algorithm for scheduling strategies that are at their core comparison-based sorting algorithms and translate corresponding upper and lower complexity bounds to the scheduling setting.
For instances with $n$ jobs and a precedence DAG with maximum degree $\Delta$, we incrementally build a topological ordering with $O(n)$ preprocessing and $O(\Delta)$ delay.
We prove a matching lower bound and show with an adversary argument that the delay lower bound holds even in case the DAG has constant average degree and the ordering is emitted out-of-order in the form of insert operations.
We complement our theoretical results with experiments that highlight the improved time-to-first-output and discuss research opportunities for similar incremental approaches for other scheduling problems.
Primary Keywords: Theory
Category: Long
Student: Graduate
Submission Number: 193
Loading