Single machine total tardiness maximization problems: complexity and algorithms (Q367638)
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: Single machine total tardiness maximization problems: complexity and algorithms |
scientific article; zbMATH DE number 6208489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine total tardiness maximization problems: complexity and algorithms |
scientific article; zbMATH DE number 6208489 |
Statements
Single machine total tardiness maximization problems: complexity and algorithms (English)
0 references
16 September 2013
0 references
scheduling
0 references
single machine maximization problems
0 references
complexity
0 references
dynamic programming
0 references
0 references
0 references
0.9112002849578856
0 references
0.8787170052528381
0 references
0.8741359710693359
0 references
0.8602831959724426
0 references
0.8514270782470703
0 references
