What is it about?
This short note corrects a mistake in the NP-hardness proof of a scheduling problem contained in an earlier paper by the authors in Journal of Scheduling (2012).
Featured Image
Read the Original
This page is a summary of: Erratum to: Minimizing total tardiness on parallel machines with preemptions, Journal of Scheduling, January 2013, Springer Science + Business Media,
DOI: 10.1007/s10951-013-0313-5.
You can read the full text:
Contributors
The following have contributed to this page
