Complexity results for scheduling tasks with discrete starting times (Q3319772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3850469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for scheduling tasks with discrete starting times |
scientific article; zbMATH DE number 3850469 |
Statements
Complexity results for scheduling tasks with discrete starting times (English)
0 references
1982
0 references
deterministic scheduling
0 references
prescribed starting times
0 references
complexity analysis
0 references
0.9088998436927797
0 references
0.8495092988014221
0 references
0.8358769416809082
0 references
