Online busy time scheduling with flexible jobs

Susanne Albers; G. Wessel van der Heijden

Home/Archive/arXiv

arXiv · 2405.08595

Online busy time scheduling with flexible jobs

Susanne Albers·G. Wessel van der Heijden

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the online busy time scheduling problem motivated by energy and cost minimization in cloud computing systems. The input is a set of jobs $J=\{1,\dots,n\}$ where each job $j\in J$ has a release time $r_j$, deadline $d_j$, and processing time $p_j$. $m$ homogeneous machines are given with a parallelism parameter $g\geq 1$, which is the maximal number of jobs that can be processed simultaneously on a machine. A machine is called \emph{busy} when at least one job is being processed. The objective is to find a feasible schedule for all jobs such that the sum of busy times over all machines is minimized. We consider the online setting, where a job $j\in J$ is revealed at its release time $r_j$. We show multiple algorithms in different problem variants that have a tight competitive ratio. For the busy time scheduling problem, uniform processing time jobs, and where the parallelism is unbounded ($g=\infty$), we show a $2$-competitive algorithm and an online adversary that shows that the algorithm is tight. For the setting where jobs have arbitrary processing time, agreeable deadlines, and the parallelism is unbounded, we show a different tight $2$-competitive algorithm. For machines with bounded parallelism, we show lower bounds on the competitive ratio of any online algorithm when $g$ is small. Furthermore, we improve the setting with arbitrary jobs where the algorithm is allowed lookahead.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Susanne Albers, G. Wessel van der Heijden. 2024-05-14. Online busy time scheduling with flexible jobs. https://arxiv.org/abs/2405.08595

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗