Semi-online scheduling problems on two identical machines with inexact partial information (Q884466)
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 5161887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-online scheduling problems on two identical machines with inexact partial information |
scientific article; zbMATH DE number 5161887 |
Statements
Semi-online scheduling problems on two identical machines with inexact partial information (English)
0 references
6 June 2007
0 references
scheduling
0 references
analysis of algorithm
0 references
semi-online
0 references
competitive analysis
0 references
disturbance parameter
0 references
0 references
0.98555725812912
0 references
0.9569475650787354
0 references
0.9535276293754578
0 references
0.8923858404159546
0 references
