Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight lower bounds for semi-online scheduling on two uniform machines with known optimum |
scientific article |
Statements
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (English)
0 references
2 September 2019
0 references
semi-online scheduling
0 references
makespan minimization
0 references
machine scheduling
0 references
Lower bounds
0 references
0 references
0 references
0 references
