Pages that link to "Item:Q2368997"
From MaRDI portal
The following pages link to Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997):
Displayed 13 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups (Q428876) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Energy-efficient bi-objective single-machine scheduling with power-down mechanism (Q1652365) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)