A note on online strip packing
From MaRDI portal
Publication:1029271
DOI10.1007/s10878-007-9125-xzbMath1168.90601OpenAlexW2001066639MaRDI QIDQ1029271
Deshi Ye, Xin Han, Guo-Chuan 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
Related Items (21)
Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ A new lower bound for online strip packing ⋮ A tight analysis of Brown-Baker-Katseff sequences for online strip packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ The generalization of scheduling with machine cost ⋮ Improved upper bounds for online malleable job scheduling ⋮ Online multiple-strip packing ⋮ Improved online algorithms for parallel job scheduling and strip packing ⋮ Unnamed Item ⋮ Online malleable job scheduling for \(m\leq 3\) ⋮ Online square packing with gravity ⋮ Parameterized complexity of strip packing and minimum volume packing ⋮ WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION ⋮ New upper bounds for online strip packing ⋮ A new upper bound for the online square packing problem in a strip ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ Online Algorithm for Parallel Job Scheduling and Strip Packing ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ Online scheduling of moldable parallel tasks ⋮ Improved lower bound for online strip packing
Cites Work
- Unnamed Item
- Shelf algorithms for on-line strip packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- On-line scheduling of parallel jobs in a list
- Lower bounds for on-line two-dimensional packing algorithms
- On strip packing With rotations
- Shelf Algorithms for Two-Dimensional Packing Problems
- Complexity of Scheduling Parallel Task Systems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Strip Packing vs. Bin Packing
This page was built for publication: A note on online strip packing
