On scheduling with the non-idling constraint (Q5895181)
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 6345814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On scheduling with the non-idling constraint |
scientific article; zbMATH DE number 6345814 |
Statements
On scheduling with the non-idling constraint (English)
0 references
18 September 2014
0 references
scheduling
0 references
non-idling constraint
0 references
complexity
0 references
algorithm
0 references
deterministic
0 references
0 references
0 references
0.9999985694885254
0 references
0.9126607179641724
0 references
0.826938271522522
0 references
0.8171274065971375
0 references
