A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work

When does a dynamic programming formulation guarantee the existence of an FPTAS?

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics

Approximation algorithms for minimizing the total weighted tardiness on a single machine

Theoretical Computer Science

Late work minimization in a small flexible manufacturing system

Computers and Industrial Engineering

Late work minimization in flow shops by a genetic algorithm

Computers and Industrial Engineering

Improving the complexities of approximation algorithms for optimization problems

Operations Research Letters