Semi-online Scheduling: A Survey

Debasis Dwibedy; Rakesh Mohanty

Home/Archive/arXiv

arXiv · 2005.08614

Semi-online Scheduling: A Survey

Debasis Dwibedy·Rakesh Mohanty

View original source ↗Read source document ↗Export metadata ↓

Abstract

In online scheduling, jobs are available one by one and each job must be scheduled irrevocably before the availability of the next job. Semi-online scheduling is a relaxed variant of online scheduling, where an additional memory in terms of buffer or an Extra Piece of Information(EPI) is provided along with input data. The EPI may include one or more of the parameter(s) such as size of the largest job, total size of all jobs, arrival sequence of the jobs, optimum makespan value or range of job's processing time. A semi-online scheduling algorithm was first introduced in 1997 by Kellerer et al. They envisioned semi-online scheduling as a practically significant model and obtained improved results for $2$-identical machine setting. This paper surveys scholarly contributions in the design of semi-online scheduling algorithms in parallel machine models such as identical and uniformly related by considering job's processing formats such as preemptive and non-preemptive with the optimality criteria such as Min-Max and Max-Min. The main focus is to present state of the art competitive analysis results of well-known semi-online scheduling algorithms in a chronological overview. The survey first introduces the online and semi-online algorithmic frameworks for the multi-processor scheduling problem with important applications and research motivation, followed by a taxonomy for semi-online scheduling. Fifteen well-known semi-online scheduling algorithms are stated. Important competitive analysis results are presented in a chronological way by highlighting the critical ideas and intuition behind the results. An evolution time-line of semi-online scheduling setups and a classification of the references based on EPI are outlined. Finally, the survey concludes with the exploration of some of the interesting research challenges and open problems.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Debasis Dwibedy, Rakesh Mohanty. 2020-05-18. Semi-online Scheduling: A Survey. https://arxiv.org/abs/2005.08614

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↗