A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10255-012-0137-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10255-012-0137-7 / rank | |||
Normal rank | |||
Latest revision as of 19:53, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size |
scientific article |
Statements
A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (English)
0 references
14 February 2017
0 references
analysis of algorithms
0 references
scheduling
0 references
machine covering
0 references
semi-online
0 references
competitive ratio
0 references
0 references
