A special case of the single-machine total tardiness problem is NP-hard
type: Item
instance of: scholarly article
title: A special case of the single-machine total tardiness problem is NP-hard
zbMATH Open document ID: 1260.93116
DOI: 10.1134/S1064230706030117
published in: Journal of Computer and Systems Sciences International
publication date: 2013-04-12T00:00:00Z
Mathematics Subject Classification ID: 93C83
zbMATH DE Number: 6153775
author: Evgeny R. Gafarov
author: Alexander A. Lazarev
MaRDI profile type: Publication
cites work: Q4198056
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Q4124332
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
cites work: On decomposition of the total tardiness problem
full work available at URL: s1064230706030117
OpenAlex ID: W2621839118
description: scientific article; zbMATH DE number 6153775