The complexity of cyclic scheduling for identical jobs (Q5263822)
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 6460055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of cyclic scheduling for identical jobs |
scientific article; zbMATH DE number 6460055 |
Statements
17 July 2015
0 references
identical tasks
0 references
cyclic scheduling
0 references
0.869158923625946
0 references
0.8686621785163879
0 references
0.8685688972473145
0 references
0.8581640124320984
0 references
0.8541663289070129
0 references
