Shelf Algorithms for Two-Dimensional Packing Problems
From MaRDI portal
Cited in
(48)- A note on online strip packing
- Expected performance of the shelf heuristic for 2-dimensional packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Oriented aligned rectangle packing problem
- Knowledge based approach to the cutting stock problem
- Packing problems
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Scheduling space-sharing for internet advertising
- iGreen: green scheduling for peak demand minimization
- New upper bounds for online strip packing
- The two-dimensional cutting stock problem revisited
- The nesting problem in the leather manufacturing industry
- Efficient heuristics for robot acquisition planning for a CIM system
- A new upper bound for the online square packing problem in a strip
- Techniques and results on approximation algorithms for packing circles
- The variable-width strip packing problem
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Online scheduling of moldable parallel tasks
- Improved lower bound for online strip packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Approximate strip packing: revisited
- Scheduling non-preemptible jobs to minimize peak demand
- Shelf algorithms for on-line strip packing
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- An exact algorithm for non-preemptive peak demand job scheduling
- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
- A new lower bound for online strip packing
- On some packing problem related to dynamic storage allocation
- The generalization of scheduling with machine cost
- Online square packing with gravity
- On-line bin packing ? A restricted survey
- Online strip packing with polynomial migration
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- An efficient job scheduling algorithm in partitionable mesh connected systems
- On-line algorithms for packing rectangles into several strips
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Probabilistic analysis of shelf algorithms for strip packing
- Average-case analysis of cutting and packing in two dimensions
- Dynamic storage allocation with known durations
- Online strip packing with modifiable boxes
- Online multiple-strip packing
- Improved online algorithms for parallel job scheduling and strip packing
- Recent advances on two-dimensional bin packing problems
- A new branch-and-cut approach for integrated planning in additive manufacturing
- Online packing to minimize area or perimeter
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing
- On-line scheduling of parallel jobs in a list
This page was built for publication: Shelf Algorithms for Two-Dimensional Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670602)
