Server cloud scheduling

DOI10.1007/S00453-023-01189-XMaRDI QIDQ6130327

Simon Pukrop, Marten Maack, Friedhelm Meyer auf der Heide

Publication date: 2 April 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

schedulingapproximationprecedence constraintscloudNP-hardnesscommunication delays

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Cost-efficient scheduling on machines from the cloud
• Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6--10, 2021. Revised selected papers
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• Hardness of Precedence Constrained Scheduling on Identical Machines
• Scheduling on Two Unbounded Resources with Communication Costs
• Approximating the Pareto Front of Multi-criteria Optimization Problems
• Algorithms for Scheduling Independent Tasks
• Complexity of Scheduling under Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Server cloud scheduling