Technical Note—A Note on the Weighted Tardiness Problem
From MaRDI portal
Recommendations
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Improved heuristics for the n-job single-machine weighted tardiness problem
- A new lower bounding scheme for the total weighted tardiness problem.
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Minimizing the weighted sum of squared tardiness on a single machine
Cited in
(14)- Real-time scheduling of an automated manufacturing center
- A note on the equivalence of two heuristics to minimize total tardiness
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- A new lower bounding scheme for the total weighted tardiness problem.
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Minimizing the weighted sum of squared tardiness on a single machine
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Minimizing total tardiness on a single machine with unequal release dates
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
- Scheduling on parallel identical machines to minimize total tardiness
This page was built for publication: Technical Note—A Note on the Weighted Tardiness Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763888)
