On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136)
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: On-line scheduling on a single machine: Maximizing the number of early jobs |
scientific article; zbMATH DE number 1588391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line scheduling on a single machine: Maximizing the number of early jobs |
scientific article; zbMATH DE number 1588391 |
Statements
On-line scheduling on a single machine: Maximizing the number of early jobs (English)
0 references
3 September 2002
0 references
combinatorial problems
0 references
online algorithms
0 references
competitive analysis
0 references
worst-case bounds
0 references
single-machine scheduling
0 references
0 references
0 references
0.8965659141540527
0 references
0.8938407301902771
0 references
0.885612428188324
0 references
0.8563132882118225
0 references
0.8395723104476929
0 references
