Sciweavers

Share
COCOON
2009
Springer

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

8 years 6 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its due date. We present an FPTAS for the basic scheduling problem of minimizing the total weighted tardiness when the number of distinct due dates is fixed. Previously, an FPTAS was known only for the case where all jobs have a common due date.
George Karakostas, Stavros G. Kolliopoulos, Jing W
Added 16 Feb 2011
Updated 16 Feb 2011
Type Journal
Year 2009
Where COCOON
Authors George Karakostas, Stavros G. Kolliopoulos, Jing Wang
Comments (0)
books