Faster minimization of tardy processing time on a single machine
From MaRDI portal
Recommendations
- Minimizing the weighted number of tardy jobs via (,+)-convolutions
- On minimizing the sum of k tardinesses
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- A faster algorithm for a due date assignment problem with tardy jobs
- Minimizing the number of tardy job units under release time constraints
Cites work
- A faster pseudopolynomial time algorithm for subset sum
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A near-linear pseudopolynomial time algorithm for subset sum
- Bounds on Multiprocessing Timing Anomalies
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- Introduction to algorithms.
- On problems equivalent to \((\min,+)\)-convolution
- Reducibility among combinatorial problems
- SETH-based lower bounds for subset sum and bicriteria path
- Simple multivariate polynomial multiplication
Cited in
(11)- Quick minimization of tardy processing time on a single machine
- Computing generalized convolutions faster than brute force
- Minimizing the weighted number of tardy jobs via (,+)-convolutions
- Minimizing tardy processing time on a single machine in near-linear time
- Minimizing tardy processing time on a single machine in near-linear time
- Computing generalized convolutions faster than brute force
- Minimizing the weighted number of tardy jobs is W[1]-hard
- Single-machine scheduling to minimize the number of tardy jobs with release dates
- Does subset sum admit short proofs?
- Minimizing the number of tardy jobs with uniform processing times on parallel machines
- Minimizing the weighted number of tardy jobs is W[1]-hard
This page was built for publication: Faster minimization of tardy processing time on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134746)
