Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689)
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 special cases of the single machine total tardiness problem and an application to the even-odd partition problem |
scientific article; zbMATH DE number 5613122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem |
scientific article; zbMATH DE number 5613122 |
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
0 references
0.8501257300376892
0 references
0.8390591144561768
0 references
0.838607132434845
0 references
0.8344233632087708
0 references
0.8315555453300476
0 references
