Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
From MaRDI portal
(Redirected from Publication:708332)
Recommendations
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem 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
- A comment on scheduling two parallel machines with capacity constraints
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Approximation schemes for a class of subset selection problems
- Combinatorial Problems: Reductibility and Approximation
- Fast approximation algorithm for job sequencing with deadlines
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Minimization of half-products
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(26)- Scheduling with time-dependent discrepancy times
- Single machine scheduling to minimize total weighted tardiness
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Minsum scheduling with acceptable lead-times and optional job rejection
- Scheduling jobs with a V-shaped time-dependent processing time
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- 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
- Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- scientific article; zbMATH DE number 853068 (Why is no real title available?)
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- Single-machine scheduling with positional deadlines, time deadlines, and due date assignment for minimizing total weighted tardiness
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
This page was built for publication: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708332)
