Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times |
scientific article; zbMATH DE number 6762251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times |
scientific article; zbMATH DE number 6762251 |
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
0.8355962038040161
0 references
0.8343137502670288
0 references
0.8286272883415222
0 references
0.8277003169059753
0 references
