On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling of unit time jobs with rejection: Minimizing the total completion time |
scientific article |
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
