A note on online strip packing
From MaRDI portal
Publication:1029271
DOI10.1007/S10878-007-9125-XzbMATH Open1168.90601OpenAlexW2001066639MaRDI QIDQ1029271FDOQ1029271
Authors: Deshi Ye, Xin Han, Guochuan Zhang 
Publication date: 10 July 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9125-x
Recommendations
- Online multiple-strip packing
- On-Line Multiple-Strip Packing
- Online strip packing with modifiable boxes
- A new lower bound for online strip packing
- New upper bounds for online strip packing
- Improved lower bound for online strip packing
- A note on online hypercube packing
- On-line algorithms for packing rectangles into several strips
- Improved Lower Bound for Online Strip Packing
- Online strip packing with polynomial migration
Cites Work
- Title not available (Why is that?)
- On strip packing with rotations
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Lower bounds for on-line two-dimensional packing algorithms
- Shelf algorithms for on-line strip packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- Orthogonal Packings in Two Dimensions
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- Complexity of Scheduling Parallel Task Systems
- Strip Packing vs. Bin Packing
- On-line scheduling of parallel jobs in a list
Cited In (28)
- The generalization of scheduling with machine cost
- New upper bounds for online strip packing
- Improved online algorithms for parallel job scheduling and strip packing
- Online strip packing with modifiable boxes
- A new upper bound for the online square packing problem in a strip
- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
- Shelf algorithms for on-line strip packing
- On-line scheduling of multi-core processor tasks with virtualization
- On-Line Multiple-Strip Packing
- The variable-width strip packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Strip packing with precedence constraints and strip packing with release times
- A new lower bound for online strip packing
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Improved upper bounds for online malleable job scheduling
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Online multiple-strip packing
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Online square packing with gravity
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Online scheduling of moldable parallel tasks
- Online strip packing with polynomial migration
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Online malleable job scheduling for \(m\leq 3\)
- Parameterized complexity of strip packing and minimum volume packing
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
- Improved lower bound for online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
This page was built for publication: A note on online strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029271)
