Metraipolis › archive › dc_a2cf54dd9de5
Faster Exponential Algorithms for Multi-Machine Scheduling Problems — arXiv:2608.12224
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12224
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:52:53.387Z
- SHA-256 of the archived text
9b4a2881c8dedf56269e989cafe3612cb70e27ecff54e9de3626a5038157ef40- Stable URL of this page
https://metraipolis.com/documento/dc_a2cf54dd9de5
How to cite
Faster Exponential Algorithms for Multi-Machine Scheduling Problems — arXiv:2608.12224 — arXiv (en), https://arxiv.org/abs/2608.12224 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2cf54dd9de5 (Metraipolis archive dc_a2cf54dd9de5, sha256 9b4a2881c8dedf56269e989cafe3612cb70e27ecff54e9de3626a5038157ef40)
BibTeX
@misc{dca2cf54dd9de5,
title = {Faster Exponential Algorithms for Multi-Machine Scheduling Problems — arXiv:2608.12224},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12224},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2cf54dd9de5; sha256 9b4a2881c8dedf56269e989cafe3612cb70e27ecff54e9de3626a5038157ef40},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12224. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Minimizing the weighted completion times ($P \mid \mid \Sigma w_j C_j$) and weighted number of tardy jobs ($P \mid \mid \Sigma w_j U_j$) on multiple identical machines are two classical NP-hard scheduling problems. As shown by Lenté et al. (2014), both problems can be solved in time ${O}^{\star}(3^n)$. In this paper, we improve these bounds to ${O}(2.755^n)$ and ${O}^{\star}(2^n)$, respectively. Our algorithm for $P \mid \mid \Sigma w_j C_j$ exploits the meet-in-the-middle paradigm and an efficient data structure answering linear programming queries. Additionally, when the number of machines is at most $6$, we show that the running time for $P \mid \mid \Sigma w_j C_j$ can further be improved. Both scheduling problems are generalizations of the classical Bin Packing problem, which can be solved in ${O}^{\star}(2^n)$ time. Improving this running time is an important open question. We show that, when assuming the Asymptotic Rank Conjecture (ARC), Bin Packing can be solved in time ${O}((2-\varepsilon)^n)$ for some $\varepsilon >0$. Our algorithm makes use of two main ingredients: the recent ${O}((2-\varepsilon)^n)$-time algorithm of Nederlof et al. [SICOMP'23] for Bin Packing when the number of bins is a fixed constant, and the ${O}((2-\varepsilon)^n)$-time algorithm of Björklund et al. [SODA'25] for special instances of the $3$-way Partitioning problem when assuming ARC.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.12224 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:48:37.125Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).