Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.08550

Online Total Completion Time Scheduling on Parallel Identical Machines

Uwe Schwiegelshohn
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate deterministic non-preemptive online scheduling with delayed commitment for total completion time minimization on parallel identical machines. In this problem, jobs arrive one-by-one and their processing times are revealed upon arrival. An online algorithm can assign a job to a machine at any time after its arrival. We neither allow preemption nor a restart of the job, that is, once started, the job occupies the assigned machine until its completion. Our objective is the minimization of the sum of the completion times of all jobs. In the more general weighted version of the problem, we multiply the completion time of a job by the individual weight of the job. We apply competitive analysis to evaluate our algorithms. We improve 25-year-old lower bounds for the competitive ratio of this problem by optimizing a simple job pattern. These lower bounds decrease with growing numbers of machines. Based on the job pattern, we develop an online algorithm which is an extension of the delayed-SPT (Shortest Processing Time first) approach to the parallel machine environment. We show that the competitive ratio is at most 1.546 for any even machine number which is a significant improvement over the best previously known competitive ratio of 1.791. For the two-machine environment, this algorithm achieves a tight competitive ratio. This is the first algorithm which optimally solves an online total completion time problem in a parallel machine environment. Finally, we give the first separation between the weighted and unweighted versions of the problem by showing that in the two-machine environment, the competitive ratio of the weighted completion time objective is strictly larger than 1.546.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Uwe Schwiegelshohn. 2022-07-18. Online Total Completion Time Scheduling on Parallel Identical Machines. https://arxiv.org/abs/2207.08550

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

KEEP EXPLORING

Related papers

arXiv2026

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph

We provide an efficient $ O(n^2) $ implementation for solving the all pairs minimax path problem or widest path problem in an undirected dense graph. It is a code implementation of the Algorithm 4 (MMJ distance by Calculation and Copy) in a previous paper. The distance matrix is also called the all points path distance (APPD). We conducted experiments to test the implementation and algorithm, compared it with several other algorithms for solving the APPD matrix. Result shows Algorithm 4 works good for solving the widest path or minimax path APPD matrix. It can drastically improve the efficiency for computing the APPD matrix. There are several theoretical outcomes which claim the APPD matrix can be solved accurately in $ O(n^2) $ . However, they are impractical because there is no code implementation of these algorithms. It seems Algorithm 4 is the first algorithm that has an actual code implementation for solving the APPD matrix of minimax path or widest path problem in $ O(n^2) $, in an undirected dense graph.

cs.DS↗
arXiv2026

Approximating Partition in Deterministic Near-Linear Time

We propose a deterministic $\widetilde{O}(n + \frac{1}ε)$-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up to a polylogarithmic factor) assuming SETH (Strong Exponential Time Hypothesis) [Abboud, Bringmann, Hermelin, and Shabtay'22]. Prior to our work, the best known FPTAS for Partition runs in $\widetilde{O}(n + (\frac{1}ε)^{5/4})$ time [Deng, Jin and Mao'23, Wu and Chen'22]. Our result is obtained by solving a more general problem of weakly approximating Subset Sum.

cs.DS↗
arXiv2026

Dynamic Treewidth in Logarithmic Time

We present a dynamic data structure that maintains a tree decomposition of width at most $9k+8$ of a dynamic graph with treewidth at most $k$, which is updated by edge insertions and deletions. The amortized update time of our data structure is $2^{O(k)} \log n$, where $n$ is the number of vertices. The data structure also supports maintaining any ``dynamic programming scheme'' on the tree decomposition, providing, for example, a dynamic version of Courcelle's theorem with $O_{k}(\log n)$ amortized update time; the $O_{k}(\cdot)$ notation hides factors that depend on $k$. This improves upon a result of Korhonen, Majewski, Nadara, Pilipczuk, and Sokołowski [FOCS 2023], who gave a similar data structure but with amortized update time $2^{k^{O(1)}} n^{o(1)}$. Furthermore, our data structure is arguably simpler. Our main novel idea is to maintain a tree decomposition that is ``downwards well-linked'', which allows us to implement local rotations and analysis similar to those for splay trees.

cs.DS↗