Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818)
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: Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one |
scientific article; zbMATH DE number 6107355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one |
scientific article; zbMATH DE number 6107355 |
Statements
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (English)
0 references
15 November 2012
0 references
scheduling
0 references
single machine problems
0 references
maximization problems
0 references
total tardiness
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9262309
0 references
0.8918498
0 references
0.88768375
0 references
0.87035465
0 references
0.86828315
0 references
0.8598194
0 references
0 references
0.85822225
0 references
