Scheduling firm real-time applications on the edge with single-bit execution time prediction

SM Salman, VL Dao, AV Papadopoulos… - 2023 IEEE 26th …, 2023 - ieeexplore.ieee.org
The edge computing paradigm brings the capabilities of the cloud such as on-demand
resource availability to the edge for applications with low-latency and real-time …

A competitive algorithm for throughput maximization on identical machines

B Moseley, K Pruhs, C Stein, R Zhou - Mathematical Programming, 2024 - Springer
A competitive algorithm for throughput maximization on identical machines | Mathematical
Programming Skip to main content SpringerLink Account Menu Find a journal Publish with us …

Online throughput maximization on unrelated machines: Commitment is no burden

F Eberle, N Megow, K Schewior - ACM Transactions on Algorithms, 2023 - dl.acm.org
We consider a fundamental online scheduling problem in which jobs with processing times
and deadlines arrive online over time at their release dates. The task is to determine a …

A Competitive Algorithm for Throughout Maximization on Identical Machines

B Moseley, K Pruhs, C Stein, R Zhou - arXiv preprint arXiv:2111.06564, 2021 - arxiv.org
This paper considers the basic problem of scheduling jobs online with preemption to
maximize the number of jobs completed by their deadline on $ m $ identical machines. The …

Scheduling and packing under uncertainty

F Eberle - International Conference on Operations Research, 2021 - Springer
Uncertainty in the input parameters is a major hurdle when trying to directly apply classical
results from combinatorial optimization to real-word challenges. Hence, designing …

[PDF][PDF] On Combinatorial and Stochastic Optimization

R Zhou - 2023 - cmu.edu
In this dissertation, we study four problems in combinatorial and stochastic optimization. The
first two chapters give improved approximation algorithms for classic combinatorial …