On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127124827, #quickstatements; #temporary_batch_1722209980517 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(00)00061-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980008867 / rank | |||
Normal rank | |||
Latest revision as of 10:32, 30 July 2024
scientific article; zbMATH DE number 1588391
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
