Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint Full article
| Source | Lecture Notes in Computer Science Compilation, 2021. ISBN 9783030778750. |
||
|---|---|---|---|
| Output data | Year: 2021, Volume: 12755, Pages: 267-279 Pages count : 13 DOI: 10.1007/978-3-030-77876-7_18 | ||
| Tags | Approximation algorithm; Multiprocessor job; NP-hardness; Scheduling; Speed scaling | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Russian Foundation for Basic Research | 20-07-00458 |
Cite:
Kononov A.
, Kovalenko Y.
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
In compilation Lecture Notes in Computer Science. 2021. – Т.12755. – C.267-279. – ISBN 9783030778750. DOI: 10.1007/978-3-030-77876-7_18 Scopus OpenAlex
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
In compilation Lecture Notes in Computer Science. 2021. – Т.12755. – C.267-279. – ISBN 9783030778750. DOI: 10.1007/978-3-030-77876-7_18 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85111381806 |
| OpenAlex: | W3183251510 |