scientific article; zbMATH DE number 2086631

MaRDI QIDQ4737166zbMATH OpenFDO

Authors Leah Epstein, S. S. Seiden, Rob van Stee

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800306.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• New Bounds for Variable-Sized Online Bin Packing
• A new version of on-line variable-sized bin packing
• Algorithms – ESA 2004
• Online bin packing with resource augmentation
• Online variable-sized bin packing

Cited in

(4)

• Fault tolerant scheduling of tasks of two sizes under resource augmentation
• Online bin packing with resource augmentation
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
• New Bounds for Variable-Sized Online Bin Packing

This page was built for publication:

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