Approximation algorithms for minimizing the total weighted tardiness on a single machine
From MaRDI portal
Publication:2368997
Recommendations
- STACS 2004
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Single machine scheduling to minimize total weighted tardiness
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
Cites work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A fully polynomial approximation scheme for the total tardiness problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- scientific article; zbMATH DE number 167292 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling with deadlines and loss functions
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single machine scheduling to minimize total weighted tardiness
- STACS 2004
Cited in
(32)- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Non-approximability of just-in-time scheduling
- On minimizing the sum of k tardinesses
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Energy-efficient bi-objective single-machine scheduling with power-down mechanism
- Single machine scheduling to minimize total weighted tardiness
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Single machine scheduling with a common due date: total weighted tardiness problems
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
- Optimal restricted due date assignment in scheduling
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- STACS 2004
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- New Precedence Theorems for One-Machine Weighted Tardiness
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
This page was built for publication: Approximation algorithms for minimizing the total weighted tardiness on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368997)
