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

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!