Server cloud scheduling

DOI10.1007/978-3-030-92702-8_10OpenAlexW4205254929MaRDI QIDQ2085746

Simon Pukrop, Friedhelm Meyer auf der Heide, Marten Maack

Publication date: 19 October 2022

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

zbMATH Keywords

schedulingapproximationprecedence constraintscloudNP-hardnesscommunication delays

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Cost-efficient scheduling on machines from the cloud
• Hardness of Precedence Constrained Scheduling on Identical Machines
• Scheduling on Two Unbounded Resources with Communication Costs
• Complexity of Scheduling under Precedence Constraints
• Scheduling jobs with communication delays: Using infeasible solutions for approximation
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
• A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Server cloud scheduling