Algorithms for Scheduling Tasks on Unrelated Processors (Q3925878): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q128252770, #quickstatements; #temporary_batch_1722788207324 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322276.322284 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005845593 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128252770 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:21, 4 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Scheduling Tasks on Unrelated Processors |
scientific article |
Statements
Algorithms for Scheduling Tasks on Unrelated Processors (English)
0 references
1981
0 references
nonpreemptive schedules
0 references
worst case finishing time
0 references
performance ratio
0 references
largest processing time
0 references
