Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
From MaRDI portal
Publication:708332
DOI10.1016/J.DAM.2010.01.013zbMATH Open1197.90209OpenAlexW1963587549MaRDI QIDQ708332FDOQ708332
Authors: Imed Kacem 
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.01.013
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
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Minimization of half-products
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Fast approximation algorithm for job sequencing with deadlines
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- 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
- Approximation algorithms for scheduling a single machine to minimize total late work
- Combinatorial Problems: Reductibility and Approximation
- A comment on scheduling two parallel machines with capacity constraints
Cited In (23)
- Scheduling with time-dependent discrepancy times
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- Scheduling jobs with a V-shaped time-dependent processing time
- Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
- Single machine scheduling with a common due date: total weighted tardiness problems
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- 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
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- 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
- 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
- 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
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)
