Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2023.113937 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2023.113937 / rank | |||
Normal rank | |||
Latest revision as of 17:53, 30 December 2024
scientific article; zbMATH DE number 7688227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity |
scientific article; zbMATH DE number 7688227 |
Statements
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (English)
0 references
23 May 2023
0 references
streaming algorithms
0 references
scheduling
0 references
parallel machines
0 references
total completion time
0 references
varying processing capacity
0 references
