OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505)
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 5017991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES |
scientific article; zbMATH DE number 5017991 |
Statements
OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (English)
0 references
6 April 2006
0 references
semi-online
0 references
scheduling
0 references
uniform machines
0 references
preemption
0 references
competitive ratio
0 references
0 references
0.9140198826789856
0 references
0.8945088386535645
0 references
0.8729671835899353
0 references
0.8719574213027954
0 references
0.8689923286437988
0 references
