Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight upper bounds for semi-online scheduling on two uniform machines with known optimum |
scientific article |
Statements
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (English)
0 references
15 June 2018
0 references
scheduling
0 references
semi-online algorithm
0 references
makespan minimization
0 references
mixed-integer linear programming
0 references
