On-Line Multiple-Strip Packing

Authors:
Deshi Ye;Xin Han;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, China 310027;Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Tokyo, Japan 113-8656;College of Computer Science, Zhejiang University, Hangzhou, China 310027 and State Key Lab of CAD & CG, Zhejiang University,
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 10
Cited 5

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
Shelf algorithms for on-line strip packing

Information Processing Letters
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Virtual hierarchies to support server consolidation

Proceedings of the 34th annual international symposium on Computer architecture
On-line scheduling of parallel jobs in a list

Journal of Scheduling
Incremental Medians via Online Bidding

Algorithmica
Online algorithm for parallel job scheduling and strip packing

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online scheduling of parallel jobs on two machines is 2-competitive

Operations Research Letters

Analysis of multi-organization scheduling algorithms

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A fast 5/2-approximation algorithm for hierarchical scheduling

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Scheduling jobs on heterogeneous platforms

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximation algorithms for multiple strip packing

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A (2+ε)-approximation for scheduling parallel jobs in platforms

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the multiple-strip packing problem, in which the goal is to pack all the rectangles into m vertical strips of unit widths such that the maximum height among strips used is minimized. A number of on-line algorithms for this problem are proposed, in which the decision of delivering the rectangles to strips as well as packing the rectangles in strips must be done on-line. Both randomized and deterministic on-line algorithms are investigated, and all of them are guaranteed to have constant competitive ratios.