Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847): Difference between revisions
From MaRDI portal
Latest revision as of 22:12, 15 July 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
0 references