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

DOI10.1016/j.tcs.2023.113937arXiv2204.01976MaRDI QIDQ6039898

Yumei Huo, Bin Fu, Hairong Zhao

Publication date: 23 May 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.01976

zbMATH Keywords

schedulingparallel machinestotal completion timestreaming algorithmsvarying processing capacity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Multitasking via alternate and shared processing: algorithms and complexity
• Single-machine scheduling with deteriorating functions for job processing times
• Control of the service process in a queueing system
• Probabilistic counting algorithms for data base applications
• Scheduling on machines with variable service rates
• Queueing systems with vacations - a survey
• Selection and sorting with limited storage
• The space complexity of approximating the frequency moments
• Scheduling with limited machine availability
• Streaming algorithms for multitasking scheduling with shared processing
• Scheduling Problems with Learning and Ageing Effects: A Survey
• Sequencing independent jobs with a single resource
• Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Streaming algorithms for bin packing and vector scheduling

This page was built for publication: Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity