Server cloud scheduling

DOI10.1007/S00453-023-01189-XMaRDI QIDQ6130327zbMATH OpenFDO

Authors Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop

Publication date 2 April 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-023-01189-X

zbMATH Keywords

approximationcloudcommunication delaysNP-hardnessprecedence constraintsscheduling

Mathematics Subject Classification ID

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

Cites work

• A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Algorithms for Scheduling Independent Tasks
• Approximating the Pareto front of multi-criteria optimization problems
• Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6--10, 2021. Revised selected papers
• Bounds for Certain Multiprocessing Anomalies
• Complexity of Scheduling under Precedence Constraints
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Hardness of precedence constrained scheduling on identical machines
• Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• Renting a cloud
• Scheduling jobs with communication delays: using infeasible solutions for approximation
• Scheduling on Two Unbounded Resources with Communication Costs

Cited in

(1)

• Enhancing the best-first-search \(\mathrm{F}\) with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

This page was built for publication: Server cloud scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130327)