A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
From MaRDI portal
(Redirected from Publication:861263)
Recommendations
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- STACS 2004
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
Cites work
- scientific article; zbMATH DE number 167292 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A fully polynomial approximation scheme for the total tardiness problem
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Single machine scheduling to minimize total weighted tardiness
Cited in
(30)- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Scheduling with time-dependent discrepancy times
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- STACS 2004
- Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Minsum scheduling with acceptable lead-times and optional job rejection
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Minimizing the maximum lateness for scheduling with release times and job rejection
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Single machine scheduling to minimize total weighted tardiness
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
This page was built for publication: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861263)
