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

DOI10.1007/S10951-013-0313-5zbMATH Open1298.90042OpenAlexW2002735797WikidataQ57633812 ScholiaQ57633812MaRDI QIDQ398871FDOQ398871

Authors: Svetlana A. Kravchenko, Frank Werner 

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 programmingtotal tardinessNP-hardnessparallel machinespolynomial algorithmpreemptive 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)

Cites Work

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

Cited In (4)

• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
• Parameterized complexity of machine scheduling: 15 open problems
• Erratum to: ``A survey on offline scheduling with rejection
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398871)