Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/16m1066610 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2569786510 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines |
scientific article |
Statements
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (English)
0 references
27 January 2017
0 references
scheduling
0 references
total completion time
0 references
power of preemption
0 references
uniformly related machines
0 references
