Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

Cited in

(only showing first 100 items - show all)

Rectangle packing with one-dimensional resource augmentation
Approximate algorithms to pack rectangles into several strips
A comparison of heuristic algorithms for cost-oriented assembly line balancing
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
scientific article; zbMATH DE number 2230208 (Why is no real title available?)
Packing, covering and tiling in two-dimensional spaces
Exact algorithms for the two-dimensional guillotine knapsack
Resource augmentation in two-dimensional packing with orthogonal rotations
Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
Parametric on-line algorithms for packing rectangles and boxes.
Approximate composable truthful mechanism design
The nesting problem in the leather manufacturing industry
An effective approximation algorithm for the malleable parallel task scheduling problem
Two-dimensional packing algorithms for layout of disconnected graphs
Improved upper bounds for online malleable job scheduling
On contiguous and non-contiguous parallel task scheduling
Malleable scheduling for flows of jobs and applications to MapReduce
A note on the Kenyon-Remila strip-packing algorithm
An approximation scheme for the two-stage, two-dimensional knapsack problem
Absolute approximation ratios for packing rectangles into bins
Scheduling space-sharing for internet advertising
A 2.5 times optimal algorithm for packing in two dimensions
The two-dimensional cutting stock problem revisited
Selfish square packing
Online strip packing with polynomial migration
Approximation and online algorithms for multidimensional bin packing: a survey
Three-dimensional packings with rotations
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
Strip packing with precedence constraints and strip packing with release times
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
Exact algorithms for the guillotine strip cutting/packing problem.
Bin packing with divisible item sizes
Probabilistic analysis of shelf algorithms for strip packing
Resource sharing combined with layout effects in high-level synthesis
A note on online strip packing
An algorithm for the 2D guillotine cutting stock problem
Two-dimensional packing problems: a survey
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
On-line scheduling of parallel jobs in a list
Guillotineable bin packing: A genetic approach
Two- and three-dimensional parametric packing
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
A Polynomial Time Approximation Scheme for the Square Packing Problem
Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
Scheduling parallel jobs to minimize the makespan
Relations between capacity utilization, minimal bin size and bin number
A new lower bound for online strip packing
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
Recent advances on two-dimensional bin packing problems
Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
Network flows and non-guillotine cutting patterns
Polynomial-time approximation schemes for circle and other packing problems
Dynamic multi-dimensional bin packing
New approximability results for two-dimensional bin packing
An approximation scheme for strip packing of rectangles with bounded dimensions
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
An improved BL lower bound
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
A block-based layer building approach for the 2D guillotine strip packing problem
Packings in two dimensions: Asymptotic average-case analysis of algorithms
On Packing Two-Dimensional Bins
Online square packing with gravity
Approximation algorithms for scheduling with resource and precedence constraints
Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
A \((5/3+\varepsilon)\)-approximation for strip packing
Average-case analysis of cutting and packing in two dimensions
Two-dimensional bin packing with one-dimensional resource augmentation
New upper bounds for online strip packing
Peak demand minimization via sliced strip packing
Models for two-dimensional bin packing problems with customer order spread
Asymptotically optimal scheduling of random malleable demands in smart grid
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
Packing Rectangles into 2OPT Bins Using Rotations
Asynchronous optimization of part logistics routing problem
Performance testing of rectangular parts-nesting heuristics
Approximate strip packing: revisited
Average-case performance analysis of a 2D strip packing algorithm -- NFDH
Greed in resource scheduling
Analysis of a first-fit algorithm for the capacitated unit covering problem
Two-bar charts packing problem
Oriented aligned rectangle packing problem
Closing the Gap for Pseudo-Polynomial Strip Packing
Upper bounds for heuristic approaches to the strip packing problem
On two dimensional packing
Techniques and results on approximation algorithms for packing circles
An improved approximation for packing big two-bar charts
Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
An improved approximation algorithm for scheduling monotonic moldable tasks
Prices of anarchy of selfish 2D bin packing games
Two dimensional knapsack with unloading constraints
Upper bounds for heuristic approaches to the strip packing problem
Tight approximation algorithms for geometric bin packing with skewed items
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Efficient heuristics for robot acquisition planning for a CIM system
A posteriori analysis of the algorithms for two-bar charts packing problem
High multiplicity strip packing with three rectangle types
iGreen: green scheduling for peak demand minimization
Offline first-fit decreasing height scheduling of power loads
Triple-solution approach for the strip packing problem with two-staged patterns

This page was built for publication: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

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