A faster algorithm for the maximum weighted tardiness problem

DOI10.1016/0020-0190(90)90184-YzbMath0703.68060OpenAlexW1980021811MaRDI QIDQ916393

Malcolm C. Fields, Greg N. Frederickson

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90184-y

zbMATH Keywords

analysis of algorithmsconvex hulljob schedulingmaximum weighted tardiness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

A note on reverse scheduling with maximum lateness objective ⋮ Minimizing functions of infeasibilities in a two-machine flow shop ⋮ Applications of a semi-dynamic convex hull algorithm ⋮ Applications of a semi-dynamic convex hull algorithm

Cites Work

• An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
• Maintenance of configurations in the plane
• On the convex layers of a planar set
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Unnamed Item

This page was built for publication: A faster algorithm for the maximum weighted tardiness problem