Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57633883, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633883 / rank | |||
Normal rank | |||
Revision as of 13:43, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem |
scientific article |
Statements
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (English)
0 references
12 October 2009
0 references
scheduling
0 references
single machine
0 references
total tardiness
0 references
even-odd partition
0 references
\(NP\)-hardness
0 references
