A faster algorithm for the maximum weighted tardiness problem
From MaRDI portal
Recommendations
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Minimizing the weighted number of tardy task units
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness
- Minimizing the number of tardy job units under release time constraints
Cites work
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Maintenance of configurations in the plane
- On the convex layers of a planar set
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
Cited in
(8)- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- Applications of a semi-dynamic convex hull algorithm
- Minimizing the weighted number of tardy task units
- Minimizing functions of infeasibilities in a two-machine flow shop
- A note on reverse scheduling with maximum lateness objective
- Applications of a semi-dynamic convex hull algorithm
- Fifty years of research in scheduling -- theory and applications
- Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities
This page was built for publication: A faster algorithm for the maximum weighted tardiness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916393)
