About one algorithm for solving scheduling problem (Q748247)
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: About one algorithm for solving scheduling problem |
scientific article; zbMATH DE number 6496331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About one algorithm for solving scheduling problem |
scientific article; zbMATH DE number 6496331 |
Statements
About one algorithm for solving scheduling problem (English)
0 references
20 October 2015
0 references
scheduling
0 references
lateness
0 references
sequencing
0 references
pseudopolynomial algorithm
0 references
properties
0 references
NP-completeness
0 references
complexity
0 references
0 references
0.8469440937042236
0 references
0.8317772150039673
0 references
0.8201285004615784
0 references
0.8190081119537354
0 references
0.8006991147994995
0 references
