Franziska Eberle

From MaRDI portal
(Redirected from Franziska Eberle)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A tight (3/2 + )-approximation algorithm for demand strip packing2026-07-03Paper
O(1/) is the answer in online weighted throughput maximization2025-11-10Paper
Scheduling on a stochastic number of machines2025-10-06Paper
Configuration balancing for stochastic requests
Mathematical Programming. Series A. Series B
2025-03-05Paper
Scheduling and packing under uncertainty2024-09-17Paper
scientific article; zbMATH DE number 7799596 (Why is no real title available?)
(available as arXiv preprint)
2024-02-05Paper
Configuration balancing for stochastic requests
Integer Programming and Combinatorial Optimization
2023-11-09Paper
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
ACM Transactions on Algorithms
2023-10-23Paper
Speed-robust scheduling: sand, bricks, and rocks
Mathematical Programming. Series A. Series B
2023-03-14Paper
Optimally Handling Commitment Issues in Online Throughput Maximization2023-02-07Paper
Online load balancing with general reassignment cost
Operations Research Letters
2022-07-22Paper
Speed-robust scheduling. Sand, bricks, and rocks
(available as arXiv preprint)
2021-12-21Paper
A general framework for handling commitment in online throughput maximization
Mathematical Programming. Series A. Series B
2020-08-28Paper
On index policies for stochastic minsum scheduling
Operations Research Letters
2020-02-10Paper
A general framework for handling commitment in online throughput maximization
Integer Programming and Combinatorial Optimization
2020-02-06Paper


Research outcomes over time


This page was built for person: Franziska Eberle