The worst-case performance ratio with time-dependent single-scheduling problems (Q5167620)
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 6311916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst-case performance ratio with time-dependent single-scheduling problems |
scientific article; zbMATH DE number 6311916 |
Statements
30 June 2014
0 references
scheduling
0 references
time-dependent scheduling
0 references
worst-case performance ratios
0 references
polynomial time algorithm
0 references
0.9041277766227722
0 references
0.8760749697685242
0 references
0.8741521835327148
0 references
0.8304598331451416
0 references
0.8276572823524475
0 references
