Online scheduling of two uniform machines to minimize total completion times (Q1013450)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5544799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling of two uniform machines to minimize total completion times |
scientific article; zbMATH DE number 5544799 |
Statements
Online scheduling of two uniform machines to minimize total completion times (English)
0 references
20 April 2009
0 references
scheduling
0 references
uniform machine
0 references
online algorithm
0 references
competitive ratio
0 references
0.9173914194107056
0 references
0.8864432573318481
0 references
0.8822279572486877
0 references
0.8727620840072632
0 references
0.8669506311416626
0 references
