Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem |
scientific article |
Statements
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (English)
0 references
26 June 1992
0 references
high multiplicity scheduling
0 references
strongly polynomial algorithms
0 references
greedy algorithm
0 references
