Complexity results for scheduling tasks with discrete starting times (Q3319772)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for scheduling tasks with discrete starting times |
scientific article |
Statements
Complexity results for scheduling tasks with discrete starting times (English)
0 references
1982
0 references
deterministic scheduling
0 references
prescribed starting times
0 references
complexity analysis
0 references
