A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074)
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: 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; zbMATH DE number 6684535
| 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; zbMATH DE number 6684535 |
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
0.8675687909126282
0 references
0.8649015426635742
0 references
0.8530780673027039
0 references
0.846505343914032
0 references
0.8450556993484497
0 references
