The Inventory Movement Optimization Problem (IMOP) is a problem encountered during the pallet preparation for shipping. Each pallet must be loaded with a set of products, depending of the customer’ orders. Products are stored in a close by stockroom. To be completed, pallets are moved to the processing zone where only one type of product is available at the same time. So one by one a vehicle brings from the stock the product needed for the pallet. The objective is to minimize the number of products moved between the stock zone and the processing zone. In the processing zone a limited number of pallets must be loaded at the same time. The vehicle which transport products to the processing zone, can be an automatic vehicle. The value of the objective function depends on two parts. The processing order of pallets but also of the processing order of the products in the processing area. When all the needed products are loaded into the pallet then the pallet is automatically moved to the shipping area. And the empty space in the processing zone can be used for another pallet. In this abstract, different resolution methods have been proposed. First a greedy heuristic builds an initial solution and second, a GRASP × ELS is applied to find a good processing order of pallets completed with an greedy Heuristic on the processing order. a set of 30 instances have been generated. The optimal solutions are found by the metaheuristic for smaller instances, and for the bigger instances where the optimal solution is unknown, results are an average between 12% and 21% of a naive lower bound.