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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 961; S. 113937
Hauptverfasser: Fu, Bin, Huo, Yumei, Zhao, Hairong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 15.06.2023
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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