How good are SPT schedules for fair optimality criteria (Q940873): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fairness Measures for Resource Allocation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time / rank | |||
Normal rank | |||
Revision as of 15:04, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How good are SPT schedules for fair optimality criteria |
scientific article |
Statements
How good are SPT schedules for fair optimality criteria (English)
0 references
3 September 2008
0 references
multiprocessor scheduling
0 references
SPT
0 references
fairness measures
0 references
approximation algorithms
0 references
