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

Authors:
Stavros G. Kolliopoulos;George Steiner
Affiliations:
Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Greece;Management Science and Information Systems, McMaster University, Hamilton, Ontario, Canada
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 10

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Single machine scheduling to minimize total late work

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

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

INFORMS Journal on Computing

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

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
Non-approximability of just-in-time scheduling

Journal of Scheduling
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 algorithms for scheduling problems with a modified total weighted tardiness objective

Operations Research Letters
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)
Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs

Operations Research
Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs

Operations Research

Quantified Score

Hi-index	5.23

Visualization

Abstract

Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave a fully polynomial-time approximation scheme (FPTAS) for it some 20 years ago. If the jobs have positive weights the problem of minimizing total weighted tardiness seems to be considerably more intricate, it. In this paper, we give some of the first approximation algorithms for it. We examine first the weighted problem with a fixed number of due dates and we design a pseudopolynomial algorithm for it. We show how to transform the pseudopolynomial algorithm to an FPTAS for the case where the weights are polynomially bounded.For the case with an arbitrary number of due dates and polynomially bounded processing times, we provide a quasipolynomial algorithm which produces a schedule whose value has an additive error proportional to the weighted sum of the due dates. We also investigate the performance of algorithms for minimizing the related total weighted late work objective.