Scheduling theory problems of type \(n|1|\sum c_i(t)\) (Q1838906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling theory problems of type \(n|1|\sum c_i(t)\) |
scientific article; zbMATH DE number 3805261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling theory problems of type \(n|1|\sum c_i(t)\) |
scientific article; zbMATH DE number 3805261 |
Statements
Scheduling theory problems of type \(n|1|\sum c_i(t)\) (English)
0 references
1983
0 references
one-processor scheduling
0 references
polynomial solvability
0 references
0 references
0 references
