Server cloud scheduling (Q6130327)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7826817

Language	Label	Description	Also known as
English	Server cloud scheduling	scientific article; zbMATH DE number 7826817

Statements

scholarly article

0 references

Server cloud scheduling (English)

0 references

0 references

Friedhelm Meyer auf der Heide

0 references

0 references

0 references

publication date

2 April 2024

0 references

zbMATH Keywords

scheduling

0 references

cloud

0 references

precedence constraints

0 references

communication delays

0 references

approximation

0 references

NP-hardness

0 references

MaRDI profile type

MaRDI publication profile

0 references

Bounds for Certain Multiprocessing Anomalies

0 references

A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies

0 references

Quasi-PTAS for scheduling with precedences using LP hierarchies

0 references

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints

0 references

Scheduling on Two Unbounded Resources with Communication Costs

0 references

0 references

Cost-efficient scheduling on machines from the cloud

0 references

Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6--10, 2021. Revised selected papers

0 references

0 references

Complexity of Scheduling under Precedence Constraints

0 references

Hardness of Precedence Constrained Scheduling on Identical Machines

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

A Functional Equation and its Application to Resource Allocation and Sequencing Problems

0 references

Algorithms for Scheduling Independent Tasks

0 references

A survey of single machine scheduling to minimize weighted number of tardy jobs

0 references

A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints

0 references

Genetic algorithms to minimize the weighted number of late jobs on a single machine.

0 references

Minimizing the weighted number of tardy jobs on a single machine with release dates

0 references

Scheduling jobs with communication delays: Using infeasible solutions for approximation

0 references

Approximating the Pareto Front of Multi-criteria Optimization Problems

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

10.1007/S00453-023-01189-X

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6130327

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6130327&oldid=39717604"