An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

From MaRDI portal
Publication:880552

DOI10.1007/s10951-006-7039-6zbMath1154.90495OpenAlexW2061109544MaRDI QIDQ880552

N. E. Zubov

Publication date: 15 May 2007

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

Full work available at URL: https://doi.org/10.1007/s10951-006-7039-6




Related Items (9)



Cites Work


This page was built for publication: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness