On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963)
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 5003052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of scheduling unit-time jobs with or-precedence constraints |
scientific article; zbMATH DE number 5003052 |
Statements
On the complexity of scheduling unit-time jobs with or-precedence constraints (English)
0 references
2 February 2006
0 references
scheduling
0 references
precedence constraints
0 references
or-networks
0 references
computational complexity
0 references
0 references
0.8714131116867065
0 references
0.8422151803970337
0 references
0.8407227396965027
0 references
0.8323835730552673
0 references
