Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (Q3706490): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q232399 / rank | |||
| Property / author | |||
| Property / author: Charles U. Martel / rank | |||
Normal rank | |||
| 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.1287/opre.33.6.1360 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018268918 / rank | |||
Normal rank | |||
Latest revision as of 22:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints |
scientific article |
Statements
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (English)
0 references
1985
0 references
memory requirement
0 references
parallel processors
0 references
algorithm
0 references
