Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633894 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of mean flow time scheduling problems with release times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3217922 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of preemptive minsum scheduling on unrelated parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3339651 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4130999 / rank | |||
Normal rank | |||
Latest revision as of 14:38, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling on uniform machines to minimize mean flow time |
scientific article |
Statements
Preemptive scheduling on uniform machines to minimize mean flow time (English)
0 references
19 May 2009
0 references
parallel uniform machines
0 references
linear programming
0 references
maximum flow
0 references
polynomial algorithm
0 references
