On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Gerhard J. Woeginger / rank | |||
Property / author | |||
Property / author: Gerhard J. Woeginger / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiprocessor Scheduling with Rejection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Techniques for scheduling with rejection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2753942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online algorithms. The state of the art / rank | |||
Normal rank |
Revision as of 15:42, 5 June 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