Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine (Q492474)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine |
scientific article; zbMATH DE number 6474157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine |
scientific article; zbMATH DE number 6474157 |
Statements
Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine (English)
0 references
20 August 2015
0 references
