Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.16001

Scheduling Jobs with Multiple Operational Modes and Tail Times

Bo Chen·Jelmer Pier van der Gaast·Xiandong Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This study explores a scheduling challenge inspired by the production of programmable materials, such as advanced liquid crystal displays. In these systems, the final quality of a product is reached only after a resource-free maturation period, known as a "tail", during which the machine is available for processing other jobs. Each job can be executed in one of several operational modes, with each mode determining a specific combination of machine processing time and subsequent tail duration. The primary task is to simultaneously choose the best mode for every job and determine their processing order. We analyze this model across several key performance goals, including the total time required to finish all jobs, the synchronization of completion times (the gap between the earliest and latest finished products), and the total weighted completion time. Our findings provide a detailed classification of the computational complexity of these problems. We demonstrate that while traditional versions with only one mode per job are simple to solve using standard rules, the introduction of just two modes makes finding optimal solutions for most of these goals computationally difficult. When the number of available modes is large, the complexity increases significantly. However, we also identify specific scenarios that remain efficiently solvable, such as when the processing order is already determined or when the goal is to minimize the average completion time. These results offer theoretical clarity and practical strategies for optimizing complex manufacturing and chemical processes involving forced cooling or maturation stages.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo Chen, Jelmer Pier van der Gaast, Xiandong Zhang. 2026-07-24. Scheduling Jobs with Multiple Operational Modes and Tail Times. https://arxiv.org/abs/2609.16001

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

KEEP EXPLORING

Related papers

arXiv2026

Quantum Space-Time Tradeoffs for TSP and Hypercube Path via Extremal Set Systems

We give a quantum analogue of the extremal set-system framework introduced by Ameli, Nederlof and Wang (FOCS 2026) and Dallant and Kozma (FOCS 2026) for space-time tradeoffs in TSP and related permutation problems. Let $1<S\leq 2$, and let $P_S$ denote the optimal inverse normalized chain density among set systems of normalized size at most $S$. We use quantum minimum finding over a covering family of set systems to obtain a bounded-error algorithm using $S^{n+o(n)}$ QRAM space and $\left(S\sqrt{P_S}\right)^{n+o(n)}$ time. Combined with the set-system constructions of Andoni, Dallant, Kozma and Yu, this gives an explicit tradeoff improving the Caroppo et al. (ESA 2026) TSP tradeoff for $1<S\le1.657$. The same method applies to a variety of permutation problems, including the Hypercube Path query problem introduced by Ambainis et al. (SODA 2019), for which it improves the previous bound of $1.817^{n+o(n)}$ for both time and QRAM space to $1.784^{n+o(n)}$ time using $1.430^{n+o(n)}$ QRAM space.

cs.DS↗
arXiv2026

Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs

We develop a framework for deterministic approximate counting of multi-spin systems beyond bounded-degree graphs. The algorithm recursively constructs rational polytopes containing the true marginal vectors and uses linear-fractional programming to obtain certified bounds on marginal ratios. For positive interactions on graphs of polynomial connective constant $D$, we establish strong spatial mixing and a fully polynomial-time approximation scheme (\textbf{FPTAS}) whenever $Dc<1$, where $c$ bounds the Birkhoff contraction coefficients of the interactions. We further extend the framework to proper colorings of sparse Erdős-Rényi random graphs using recursion on permissive blocks. For every fixed $η\in(0,1)$, sufficiently large fixed $d$, and fixed integer $q\ge(2+η)d$, we obtain an \textbf{FPTAS} for counting proper $q$-colorings of $G\sim\mathcal G(n,d/n)$ with high probability over $G$. This improves the leading constant $3$ in the earlier counting guarantee of Yin and Zhang (APPROX/RANDOM, 2016) to $2$, and asymptotically matches the spatial mixing regime established by Yin (ICALP, 2014).

cs.DS↗
arXiv2026

Tree Search With Distributional Predictions

Learning-augmented algorithms use machine-learned predictions to improve classical algorithmic guarantees when the predictions are accurate, while retaining rigorous performance guarantees when they are not. We study this paradigm for search on trees. Given a tree $T$ containing an unknown target vertex $t$, an algorithm may query any vertex $v$ and learn which neighbor of $v$ lies on the unique path from $v$ to $t$. The goal is to find $t$ using as few queries as possible. We consider the distributional setting, in which the target is drawn from an unknown distribution $p$ and the algorithm is given a predicted distribution $\widehat p$ of unknown quality. We give an algorithm with expected query complexity $O\left(H(p)+k\log η\right)$, where $H(p)$ is the Shannon entropy of the true distribution and $η$ is the earth mover's distance between $p$ and $\widehat p$ in the tree metric. We also provide a matching lower bound that shows our algorithm is asymptotically tight. Finally, experiments on real-world and synthetic trees show that our prediction-based algorithm can use substantially fewer queries than a simple baseline that trusts the prediction completely.

cs.DS↗