On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022)
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 of unit time jobs with rejection: Minimizing the total completion time |
scientific article; zbMATH DE number 1903541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling of unit time jobs with rejection: Minimizing the total completion time |
scientific article; zbMATH DE number 1903541 |
Statements
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (English)
0 references
4 May 2003
0 references
scheduling
0 references
on-line algorithm
0 references
competitive analysis
0 references
worst-case bounds
0 references
