Lower bounds for on-line single-machine scheduling. (Q1874403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for on-line single-machine scheduling. |
scientific article; zbMATH DE number 1915579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for on-line single-machine scheduling. |
scientific article; zbMATH DE number 1915579 |
Statements
Lower bounds for on-line single-machine scheduling. (English)
0 references
25 May 2003
0 references
scheduling jobs
0 references
randomized algorithms
0 references
0 references
0.8700403571128845
0 references
0.8645015954971313
0 references
0.8645015954971313
0 references
