Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847)
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: Tight upper bounds for semi-online scheduling on two uniform machines with known optimum |
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
0 references
