An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488)
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: An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times |
scientific article; zbMATH DE number 6118999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times |
scientific article; zbMATH DE number 6118999 |
Statements
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (English)
0 references
28 December 2012
0 references
multipurpose machine scheduling
0 references
online scheduling
0 references
total completion time
0 references
competitive ratio
0 references
0 references
0 references
0 references
0.8844220638275146
0 references
0.8526604771614075
0 references
0.8374031186103821
0 references
0.8286694884300232
0 references
0.828478217124939
0 references
