Online strip packing with modifiable boxes

DOI10.1016/S0167-6377(01)00081-5zbMath0981.90052WikidataQ127525838 ScholiaQ127525838MaRDI QIDQ5949922

Csanád Imreh

Publication date: 5 December 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

competitive analysisonline algorithmstrip packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

The generalization of scheduling with machine cost ⋮ Unnamed Item ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid ⋮ Parameterized complexity of strip packing and minimum volume packing ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

Cites Work

• Shelf algorithms for on-line strip packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Lower bounds for on-line two-dimensional packing algorithms
• Two-dimensional rectangle packing: On-line methods and results
• Dynamic scheduling on parallel machines
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Shelf Algorithms for Two-Dimensional Packing Problems
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• On Packing Two-Dimensional Bins
• Heuristic algorithms for on-line packing in three dimensions
• On Two Dimensional Packing
• Scheduling Parallel Machines On-Line

This page was built for publication: Online strip packing with modifiable boxes