Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57633858, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633858 / rank | |||
Normal rank | |||
Revision as of 15:04, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one |
scientific article |
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
