Scheduling and packing under uncertainty

DOI10.1007/978-3-031-08623-6_2MaRDI QIDQ6606619zbMATH OpenFDO

Authors Franziska Eberle

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_2

zbMATH Keywords

approximation algorithmsdynamic algorithmsonline algorithmspackingschedulinguncertainty

Mathematics Subject Classification ID

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

Recommendations

• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Models and Algorithms for Stochastic Online Scheduling

Cites work

• A general framework for handling commitment in online throughput maximization
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimally Handling Commitment Issues in Online Throughput Maximization
• Reducibility among combinatorial problems

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)