Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
From MaRDI portal
Publication:256707
DOI10.1007/s10479-015-2023-1zbMath1332.90113OpenAlexW2174759551MaRDI QIDQ256707
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2023-1
Cites Work
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Single machine total tardiness maximization problems: complexity and algorithms
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- Multi-project scheduling with two-stage decomposition
- Maximization problems in single machine scheduling
- Isomorphic scheduling problems
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Spatially explicit forest harvest scheduling with difference equations
- FPTAS for half-products minimization with scheduling applications
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- Minimization of ordered, symmetric half-products
- Positive half-products and scheduling with controllable processing times
- New results on the completion time variance minimization
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- Minimization of Half-Products
- Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for minclique scheduling problems
This page was built for publication: Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
