On minimizing the sum of \(k\) tardinesses

DOI10.1016/0020-0190(91)90067-RzbMath0738.68014OpenAlexW2077552856MaRDI QIDQ1178234

Gerhard J. Woeginger

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90067-r

zbMATH Keywords

schedulingtardinesses

Mathematics Subject Classification ID

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

Related Items

On \(k\)-sum optimization ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ The partial sum criterion for Steiner trees in graphs and shortest paths

Cites Work

• Minimizing Total Tardiness on One Machine is NP-Hard