A special case of the single-machine total tardiness problem is NP-hard (Q1946412): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Evgeny R. Gafarov / rank
Normal rank
 
Property / author
 
Property / author: Alexander A. Lazarev / rank
Normal rank
 
Property / author
 
Property / author: Evgeny R. Gafarov / rank
 
Normal rank
Property / author
 
Property / author: Alexander A. Lazarev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1064230706030117 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2621839118 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:44, 30 July 2024

scientific article
Language Label Description Also known as
English
A special case of the single-machine total tardiness problem is NP-hard
scientific article

    Statements

    Identifiers