Erratum to: ``Minimizing total tardiness on parallel machines with preemptions

DOI10.1007/S10951-013-0313-5zbMath1298.90042OpenAlexW2002735797WikidataQ57633812 ScholiaQ57633812MaRDI QIDQ398871

Frank Werner, Svetlana A. Kravchenko

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-013-0313-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 (3)

Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Cites Work

• A note on the paper ``Minimizing total tardiness on parallel machines with preemptions
• Minimizing total tardiness on parallel machines with preemptions
• Some simple scheduling algorithms
• Reducibility among Combinatorial Problems

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