Minimizing total tardiness on parallel machines with preemptions

DOI10.1007/s10951-010-0198-5zbMath1280.90059OpenAlexW2000325475WikidataQ57633844 ScholiaQ57633844MaRDI QIDQ2434279

Svetlana A. Kravchenko, Frank Werner

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0198-5

zbMATH Keywords

linear programmingparallel machinespolynomial algorithmNP-hardnesstotal tardinesspreemptive problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A note on the paper ``Minimizing total tardiness on parallel machines with preemptions ⋮ Erratum to: ``Minimizing total tardiness on parallel machines with preemptions

Cites Work

• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• The complexity of mean flow time scheduling problems with release times
• On a parallel machine scheduling problem with equal processing times
• Minimizing Total Tardiness on One Machine is NP-Hard
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing total tardiness on parallel machines with preemptions