A note on the paper ``Minimizing total tardiness on parallel machines with preemptions
DOI10.1007/s10951-012-0283-zzbMath1391.90304OpenAlexW2083955577MaRDI QIDQ398870
C. Lahlou, Damien Prot, Odile Bellenguez-Morineau
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-012-0283-z
Abstract computational complexity for mathematical programming problems (90C60) 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 (1)
Cites Work
This page was built for publication: A note on the paper ``Minimizing total tardiness on parallel machines with preemptions
