Complexity of a class of task scheduling problems (Q2711272)
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 1593922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of a class of task scheduling problems |
scientific article; zbMATH DE number 1593922 |
Statements
6 May 2001
0 references
task scheduling problems
0 references
Complexity of a class of task scheduling problems (English)
0 references
0.8032405972480774
0 references
0.7926551699638367
0 references
0.7777962684631348
0 references
0.7653140425682068
0 references
0.7607772350311279
0 references
