The price of fixed assignments in stochastic extensible bin packing

DOI10.1007/978-3-030-04693-4_20OpenAlexW2889165423MaRDI QIDQ1757783FDOQ1757783

Authors: Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Alexander Tesch 

Publication date: 15 January 2019

Full work available at URL: https://arxiv.org/abs/2002.00060

Recommendations

• Fast approximation methods for online scheduling of outpatient procedure centers
• The stochastic generalized bin packing problem
• Approximation and Online Algorithms
• Approximation algorithms for extensible bin packing
• Restricted Adaptivity in Stochastic Scheduling

zbMATH Keywords

approximation algorithmsstochastic schedulingextensible bin packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cited In (6)

• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Approximation schemes for the generalized extensible bin packing problem
• Stochastic Extensible Bin Packing
• Branch and Price for Chance-Constrained Bin Packing
• Adaptive Bin Packing with Overflow
• Improved bounds for stochastic extensible bin packing under distributional assumptions

This page was built for publication: The price of fixed assignments in stochastic extensible bin packing

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