Online multiple-strip packing
From MaRDI portal
Recommendations
Cites work
- A note on online strip packing
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Approximate algorithms to pack rectangles into several strips
- Bounds for Certain Multiprocessing Anomalies
- Complexity of Scheduling Parallel Task Systems
- Incremental medians via online bidding
- On-line scheduling of parallel jobs in a list
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online scheduling of parallel jobs on two machines is 2-competitive
- Orthogonal Packings in Two Dimensions
- Shelf algorithms for on-line strip packing
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(19)- A note on online strip packing
- New upper bounds for online strip packing
- Ordered strip packing
- The variable-width strip packing problem
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- 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
- On-Line Multiple-Strip Packing
- The generalization of scheduling with machine cost
- Online strip packing with polynomial migration
- Strip Packing vs. Bin Packing
- Approximate algorithms to pack rectangles into several strips
- Online Mixed Packing and Covering
- Online strip packing with modifiable boxes
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
- Online rules for container stacking
This page was built for publication: Online multiple-strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q621841)