New lower and upper bounds for on-line scheduling (Q1892104)
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 761912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower and upper bounds for on-line scheduling |
scientific article; zbMATH DE number 761912 |
Statements
New lower and upper bounds for on-line scheduling (English)
0 references
6 July 1995
0 references
worst-case analysis
0 references
on-line scheduling a set of independent jobs
0 references
parallel and identical machines
0 references
0 references
0.9136785268783568
0 references
0.9109290838241576
0 references
0.8901143074035645
0 references
0.8641387820243835
0 references
