The Order Batching Problem (OBP) can be considered a family of optimization problems related to the retrieval of goods in a warehouse. The original and most extended version of the problem consists in minimizing the total time needed to collect a group of orders. However, this version has been evolved with many other variants, where the restrictions and/or the objective function might change. In this paper, we deal with the Online Order Batching Problem (OOBP) version, which introduces the novelty to the OBP of considering orders that have arrived to the warehouse once the retrieval of previous orders has started. This family of problems has been deeply studied by the heuristic community in the past. Notice, that solving any variant of the OBP include two important activities: grouping the orders into batches (batching) and determining the route to follow by a picker to retrieve the items within the same batch (routing). We review the most outstanding proposals in the literature for the OOBP variant and we propose a new version of a competitive Variable Neighborhood Search (VNS) algorithm to tackle the problem.