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

  • Kellerer H
  • Strusevich V
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Kellerer, H., & Strusevich, V. A. (2006). A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369(1–3), 230–238. https://doi.org/10.1016/j.tcs.2006.08.030

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free