Single machine scheduling with a common due date: total weighted tardiness problems
From MaRDI portal
Recommendations
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Single machine scheduling to minimize total weighted tardiness
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- scientific article; zbMATH DE number 853068
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
Cited in
(10)- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
- Single machine scheduling to minimize total weighted tardiness
- The weighted common due date single machine scheduling problem revisited
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- scientific article; zbMATH DE number 853068 (Why is no real title available?)
- Two due date assignment problems in scheduling a single machine
This page was built for publication: Single machine scheduling with a common due date: total weighted tardiness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109947)
