Online multiple-strip packing

Authors:
Deshi Ye;Xin Han;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou 310027, China;Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Tokyo, 113-8656, Japan;College of Computer Science, Zhejiang University, Hangzhou 310027, China
Venue:
Theoretical Computer Science
Year:
2011

Citing 10
Cited 3

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

On-Line scheduling of parallel jobs in heterogeneous multiple clusters

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Coordination mechanisms for selfish parallel jobs scheduling

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The generalization of scheduling with machine cost

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study an online multiple-strip packing problem, whose goal is to pack the given rectangles into m vertical strips of unit width such that the maximum height used among the strips is minimized. Rectangles arrive one by one. The decision of delivering the rectangles to a strip as well as packing them into the strip must be done immediately and irrevocably without any information on the next rectangles. Both randomized and deterministic online algorithms are investigated, all of which are guaranteed a constant competitive ratio.