2000 character limit reached
Minimizing the Weighted Number of Tardy Jobs is W[1]-hard (2401.01740v1)
Published 3 Jan 2024 in cs.DS and cs.CC
Abstract: We consider the $1||\sum w_J U_j$ problem, the problem of minimizing the weighted number of tardy jobs on a single machine. This problem is one of the most basic and fundamental problems in scheduling theory, with several different applications both in theory and practice. We prove that $1||\sum w_J U_j$ is W[1]-hard with respect to the number $p_{#}$ of different processing times in the input, as well as with respect to the number $w_{#}$ of different weights in the input. This, along with previous work, provides a complete picture for $1||\sum w_J U_j$ from the perspective of parameterized complexity, as well as almost tight complexity bounds for the problem under the Exponential Time Hypothesis (ETH).
- A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial and Management Optimization, 10(1):219–241, 2014.
- Faster minimization of tardy processing time on a single machine. Algorithmica, 84(5):1341–1356, 2022.
- Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences, 72(8):1346–1367, 2006.
- Parameterized Complexity. Monographs in Computer Science. Springer, 1999.
- Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
- Parameterizing by the number of numbers. Theory of Computing Systems, 50(4):675–693, 2012.
- On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410(1):53–61, 2009.
- Polynomiality for bin packing with a constant number of item types. Journal of the ACM, 67(6):38:1–38:21, 2020.
- Ronald L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416–429, 1969.
- New algorithms for minimizing the weighted number of tardy jobs on a single machine. Annals of Operations Research, 298(1):271–287, 2021.
- Single machine batch scheduling to minimize the weighted number of tardy jobs. CoRR, abs/1911.12350, 2019.
- Minimizing the weighted number of tardy jobs via (max,+)(\max,+)( roman_max , + )-convolutions. INFORMS Journal on Computing - to appear.
- On the complexity of k𝑘kitalic_k-SAT. Journal of Computer and System Sciences, 62(2):367 – 375, 2001.
- Richard M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations, pages 85–103. Springer, 1972.
- Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR, abs/2311.05913, 2023. Accepted for publication in the Proc. of the 7th SIAM Symposium on Simplicity in Algorithms, SOSA 2024.
- On minimizing tardy processing time, max-min skewed convolution, and triangular structured ILPs. In Proc. of the 34th ACM-SIAM Symposium On Discrete Algorithms, SODA 2023, pages 2947–2960, 2023.
- A functional equation and its application to resource allocation and sequencing problems. Management Science, 16(1):77–84, 1969.
- Hendrik W Lenstra Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538–548, 1983.
- Dániel Marx. Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.
- Matthias Mnich and René van Bevern. Parameterized complexity of machine scheduling: 15 open problems. Computers &\&& Operations Research, 100:254–261, 2018.
- James M. Moore. An n𝑛nitalic_n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1):102–109, 1968.
- Jon M. Peha. Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time. Computers and Operations Research, 22(10):1089–1100, 1995.
- The subspace flatness conjecture and faster integer programming. In Proc. of the 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, pages 974–988, 2023.
- Sartaj K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23(1):116–127, 1976.
- Quick minimization of tardy processing time on a single machine. In Proc. of the 18th international Workshop on Algorithms and Data Structures, WADS 2023, pages 637–643, 2023.