Approximation algorithms for multiple strip packing

DOI10.1007/978-3-642-12450-1_4MaRDI QIDQ3558911zbMATH OpenOpenAlexFDO

Authors Marin Bougeret, Pierre-Francois Dutot, Christina Otte, Klaus Jansen, Denis Trystram

Publication date 11 May 2010

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12450-1_4

zbMATH Keywords

scheduling in gridsstrip packing

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• A (5/3+)-approximation for strip packing
• A (5/3 + )-approximation for strip packing
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• On-Line Multiple-Strip Packing
• New Approximability Results for 2-Dimensional Packing Problems

Cited in

(15)

• New upper bounds for online strip packing
• Approximate strip packing: revisited
• A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
• Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
• A new lower bound for online strip packing
• Linear time algorithms for multiple cluster scheduling and multiple strip packing
• Approximate composable truthful mechanism design
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• On approximating strip packing with a better ratio than 3/2
• Relations between capacity utilization, minimal bin size and bin number
• Peak demand minimization via sliced strip packing
• Approximation Algorithms for Demand Strip Packing
• High multiplicity strip packing with three rectangle types

This page was built for publication: Approximation algorithms for multiple strip packing

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