Maximizing total tardiness on a single machine in O(n^2) time via a reduction to half-product minimization
From MaRDI portal
(Redirected from Publication:256707)
Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
Recommendations
- Single machine total tardiness maximization problems: complexity and algorithms
- Algorithms for some maximization scheduling problems on a single machine
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- On minimizing the sum of \(k\) tardinesses
- Some improved algorithms on the single machine hierarchical scheduling with total tardiness as the primary criterion
Cites work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- Algorithms for minclique scheduling problems
- Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
- FPTAS for half-products minimization with scheduling applications
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Isomorphic scheduling problems
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Maximization problems in single machine scheduling
- Minimization of half-products
- Minimization of ordered, symmetric half-products
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- Multi-project scheduling with two-stage decomposition
- New results on the completion time variance minimization
- Positive half-products and scheduling with controllable processing times
- Single machine total tardiness maximization problems: complexity and algorithms
- Spatially explicit forest harvest scheduling with difference equations
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
Cited in
(3)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256707)
