A faster algorithm for the maximum weighted tardiness problem
References (7)
- et al.
An O(n log2n) algorithm for the maximum weighted tardiness problem
Inform. Process. Lett.
(1989) - et al.
Maintenance of configurations in the plane
J. Comput. System Sci.
(1981) - et al.
The Design and Analysis of Computer Algorithms
(1974)
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 ResearchMinimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy
2021, Proceedings of the 16th Conference on Computer Science and Intelligence Systems, FedCSIS 2021Deterministic machine scheduling problems
2020, arXivA note on reverse scheduling with maximum lateness objective
2013, Journal of SchedulingMinimizing 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.
Copyright © 1990 Published by Elsevier B.V.