Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity

We study the problem of minimizing total completion time on parallel machines subject to varying processing capacity. In this paper, we develop an approximation scheme for the problem under the data stream model where the input data is massive and cannot fit into memory and thus can only be scanned...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 961; s. 113937
Hlavní autoři:	Fu, Bin, Huo, Yumei, Zhao, Hairong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 15.06.2023
Témata:	Parallel machines Scheduling Streaming algorithms Total completion time Varying processing capacity Varying processing capacity Parallel machines Streaming algorithms Scheduling Total completion time
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	We study the problem of minimizing total completion time on parallel machines subject to varying processing capacity. In this paper, we develop an approximation scheme for the problem under the data stream model where the input data is massive and cannot fit into memory and thus can only be scanned a few times. Our algorithm can compute an approximate value of the optimal total completion time in one pass and output the schedule with the approximate value in two passes.
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2023.113937