Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707)
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: Maximizing total tardiness on a single machine in O(n^2) time via a reduction to half-product minimization |
scientific article; zbMATH DE number 6553025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization |
scientific article; zbMATH DE number 6553025 |
Statements
Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (English)
0 references
9 March 2016
0 references
scheduling
0 references
single machine
0 references
total tardiness
0 references
maximization
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0.8326743841171265
0 references
0.8315953612327576
0 references
0.8299707770347595
0 references
0.8285292983055115
0 references
