Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-016-0476-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2331808886 / rank | |||
Normal rank | |||
Revision as of 00:28, 20 March 2024
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
