• Corpus ID: 219559012

An Asymptotically Optimal Algorithm for Online Stacking

  title={An Asymptotically Optimal Algorithm for Online Stacking},
  author={Martin Olsen and Allan Gross},
Consider a storage area where arriving items are stored temporarily in bounded capacity stacks until their departure. We look into the problem of deciding where to put an arriving item with the objective of minimizing the maximum number of stacks used over time. The decision has to be made as soon as an item arrives, and we assume that we only have information on the departure times for the arriving item and the items currently at the storage area. We are only allowed to put an item on top of… 



Probabilistic Analysis of Online Stacking Algorithms

A simple polynomial time online algorithm is presented for the problem of deciding where to put an arriving item with the objective of using as few stacks as possible and it is proved that there exists an \(N > 0\) such that the algorithm uses no more than (1+\epsilon _1)OPT stacks.

Tree search for the stacking problem

Two heuristic approaches are proposed to solve the stacking problem, a multiple simulation algorithm using semi-greedy construction heuristics, and a stochastic best-first tree search algorithm, revealing a superior performance of the tree search approach in most cases.

On the online track assignment problem

Track assignment

A Heuristic for the Container Stacking Problem in Automated Maritime Ports

Abstract In this paper, we are interested in finding efficient practical approaches to solve the Container Stacking Problem in Maritime Ports. Given container arrivals in a container port terminal,

Solutions to Real-World Instances of PSPACE-Complete Stacking

This work investigates a complex stacking problem that stems from storage planning of steel slabs in integrated steel production and describes an algorithm that computes solutions within 5/4 of optimality for all real-world test instances.

On the complexity of container stowage planning problems

Online rules for container stacking

This paper investigates two concepts to increase efficiency and compares them to several benchmark algorithms, using a discrete-event simulation tool and found that the trade-off between stacking further away in the terminal versus stacking close by the exit points and accepting more reshuffles leads to improvements over the benchmark.

A Note on Online Colouring Problems in Overlap Graphs and Their Complements

This work considers online versions of different colouring problems in interval overlap graphs, motivated by stacking problems, and obtains a logarithmic competitive ratio with respect to the maximum ratio of interval lengths for the usual and b-bounded colouring.