Scheduling Partially Ordered Jobs Faster Than 2 n (Q3092238)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling Partially Ordered Jobs Faster Than 2 n |
scientific article |
Statements
Scheduling Partially Ordered Jobs Faster Than 2 n (English)
0 references
16 September 2011
0 references
moderately exponential algorithms
0 references
job scheduling
0 references
jobs with precedences
0 references
