Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
From MaRDI portal
Publication:2336632
DOI10.1155/2014/679702zbMATH Open1442.90082DBLPjournals/jam/MoslehiK14OpenAlexW1975123132WikidataQ59054017 ScholiaQ59054017MaRDI QIDQ2336632FDOQ2336632
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/679702
Recommendations
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- STACS 2004
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Cites Work
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Minimizing Total Tardiness on One Machine is NP-Hard
- Title not available (Why is that?)
- Single machine scheduling to minimize total weighted tardiness
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Title not available (Why is that?)
- A fully polynomial approximation scheme for the total tardiness problem
- Improving the complexities of approximation algorithms for optimization problems
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
This page was built for publication: Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336632)
