Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
From MaRDI portal
Publication:398871
DOI10.1007/s10951-013-0313-5zbMath1298.90042WikidataQ57633812 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
linear programming; parallel machines; polynomial algorithm; NP-hardness; total tardiness; preemptive problems
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
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