Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times |
scientific article |
Statements
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (English)
0 references
18 August 2017
0 references
uniformly related machines
0 references
preemptive scheduling
0 references
makespan completion times
0 references
