Scheduling and packing under uncertainty

DOI10.1007/978-3-031-08623-6_2zbMATH Open1547.90079MaRDI QIDQ6606619

Franziska Eberle

Publication date: 17 September 2024

zbMATH Keywords

uncertaintyschedulingonline algorithmspackingapproximation algorithmsdynamic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Reducibility among Combinatorial Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Optimally Handling Commitment Issues in Online Throughput Maximization
• A general framework for handling commitment in online throughput maximization

This page was built for publication: Scheduling and packing under uncertainty

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