On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of scheduling unit-time jobs with or-precedence constraints |
scientific article |
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
