Improved bounds for stochastic extensible bin packing under distributional assumptions

DOI10.1007/978-3-031-18530-4_17zbMath1528.90114OpenAlexW4313124016MaRDI QIDQ6111510

Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_17

zbMATH Keywords

approximation algorithmstochastic schedulingsecond-order stochastic dominanceextensible bin packing

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Cutting and packing problems under uncertainty: literature review and classification framework

Cites Work

• A 13/12 approximation algorithm for bin packing with extendable bins
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
• Approximation schemes for scheduling on parallel machines
• A tour of inequality
• The price of fixed assignments in stochastic extensible bin packing
• Density inference for ranking European research systems in the field of economics
• A sufficient condition for generalized Lorenz order
• Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Stochastic scheduling problems I — General strategies
• Extension of stochastic dominance theory to random variables
• Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers
• Stochastic Dominance among Log-Normal Prospects
• Models and Algorithms for Stochastic Online Scheduling
• Inequalities: theory of majorization and its applications
• Scheduling
• Restricted Adaptivity in Stochastic Scheduling

This page was built for publication: Improved bounds for stochastic extensible bin packing under distributional assumptions