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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 961; p. 113937
Main Authors:	Fu, Bin, Huo, Yumei, Zhao, Hairong
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.06.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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