A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Authors:
Hans Kellerer;Vitaly A. Strusevich
Affiliations:
Institut für Statistik and Operations Research, Universität Graz, Graz, Austria;School of Computing and Mathematical Sciences, University of Greenwich, Greenwich, London, UK
Venue:
Theoretical Computer Science
Year:
2006

Citing 5
Cited 6

A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

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

Theoretical Computer Science

An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Note: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Discrete Applied Mathematics
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups

Theoretical Computer Science
Approximation Techniques for Utilitarian Mechanism Design

SIAM Journal on Computing
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.