A faster algorithm for the maximum weighted tardiness problem

https://doi.org/10.1016/0020-0190(90)90184-YGet rights and content

Abstract

We present an O(m+n log n) algorithm for the problem of minimizing the maximum weighted tardiness for a set of n jobs with deadlines and weight functions from a certain class, and subject to a set of m precedence constraints.

References (7)

There are more references available in the full text version of this article.

Cited by (5)

  • Minimizing functions of infeasibilities in a two-machine flow shop

    2000, European Journal of Operational Research
  • Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy

    2021, Proceedings of the 16th Conference on Computer Science and Intelligence Systems, FedCSIS 2021
  • Minimizing the maximum lateness

    2004, Handbook of Scheduling: Algorithms, Models, and Performance Analysis

The research of this author was supported in part by the Office of Naval Research under contract N00014-86-K- 0689.

∗∗

The research of this author was supported in part by the National Science Foundation under grant CCR-86202271 and by the Office of Naval Research under contract N00014-86-K-0689.

View full text