Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine

DOI10.1134/S106456240701036XzbMath1327.90071MaRDI QIDQ492474

Evgeny R. Gafarov, A. G. Kvaratskheliya, Alexander A. Lazarev

Publication date: 20 August 2015

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Related Items (1)

Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

This page was built for publication: Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine