Better permutations for the single-processor scheduling with time restrictions (Q523167)
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 6706494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better permutations for the single-processor scheduling with time restrictions |
scientific article; zbMATH DE number 6706494 |
Statements
Better permutations for the single-processor scheduling with time restrictions (English)
0 references
20 April 2017
0 references
single-processor scheduling
0 references
time restrictions
0 references
worst-case analysis
0 references
0 references
0 references
0.9182176
0 references
0.9119149
0 references
0.9006106
0 references
0.8822164
0 references
0.8796505
0 references
0.8772179
0 references
0.87397575
0 references
0.8695786
0 references
