Shelf algorithms for on-line strip packing
Information Processing Letters
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Better Online Algorithms for Scheduling with Machine Cost
SIAM Journal on Computing
Preemptive online algorithms for scheduling with machine cost
Acta Informatica
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Online scheduling with machine cost and rejection
Discrete Applied Mathematics
Online scheduling with general machine cost functions
Discrete Applied Mathematics
Theoretical Computer Science
Improved online algorithms for parallel job scheduling and strip packing
Theoretical Computer Science
Improved lower bound for online strip packing
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Online scheduling of parallel jobs on two machines is 2-competitive
Operations Research Letters
New upper and lower bounds for online scheduling with machine cost
Discrete Optimization
Online strip packing with modifiable boxes
Operations Research Letters
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
Journal of Combinatorial Optimization
Hi-index | 5.23 |
We study a new online resource allocation problem. Usually in resource allocation problems the tasks are presented by rectangles, where the sides describe the time and the resource needed to perform the task. In the online problem the tasks/rectangles arrive one by one according to a list. If we are to perform the task during the shortest possible time, say H, with fixed amount of resource or by minimal resource keeping the completion time below a given bound W, then the problem can be described as online strip packing. Here we consider the problem where neither the resource nor the time is limited; we minimize the objective @c@?H+W, where @c is a fixed positive parameter. In the special case @c=1 we have to pack the incoming rectangles into a container rectangle with perimeter as small as possible. This problem is a generalization of scheduling with machine cost. We present and analyse a shelf-based online algorithm for the solution of the problem. We also consider the semi online case where the list of rectangles is ordered by decreasing height. Finally we study the version where the sizes of the rectangles are not fixed but the algorithm can modify them keeping their area fixed.