The complexity of scheduling starting time dependent tasks with release times (Q293188)
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: The complexity of scheduling starting time dependent tasks with release times |
scientific article; zbMATH DE number 6590667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of scheduling starting time dependent tasks with release times |
scientific article; zbMATH DE number 6590667 |
Statements
The complexity of scheduling starting time dependent tasks with release times (English)
0 references
9 June 2016
0 references
scheduling
0 references
sequencing
0 references
time dependence
0 references
release time
0 references
computational complexity
0 references
0 references
0.8781467080116272
0 references
0.8614705801010132
0 references
0.859895646572113
0 references
