A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports

A multi-product mathematical model for iron ore stockyard planning problem

“…According with [Menezes et al 2017], the stockyard planning problem are optimization problems in a medium-and short-term horizon, considering the quantities to be produced, prices and demands, according to the achievement of goals defined by higher levels. The technique used by the authors to solve the problem was the Column Generation (CG) with Branch and Price.…”

A Linear Relaxation-Based Heuristic for Iron Ore Stockyard Energy Planning

“…In [23], the authors focused on reclaimer scheduling in a limited stockyard (NP-complete) with stockpile replacement and reclamation sequencing using approximation algorithms and a branch-and-bound algorithm to find an exact solution to the proposed instances of the problem. For planning an iron ore stockyard, the work in [24] presents a proposal for mathematical modeling to control the stockyard-port system, including receipt through a system of rails, stockyard equipment, allocation and availability at the port, considering the quantities to be produced, and the prices and demands, according to the achievement of goals defined by higher levels. The technique used to solve the problem was the column generation (CG) with branch-and-price.…”

“…In this paper, we developed an MILP mathematical model based on [24] to plan an iron ore stockyard according to the energy cost of equipment usage and considering a variable cost over time. We solve this model using an exact technique with CPLEX [10] and a linear relaxation-based heuristic (LRBH) via Python language and CPLEX.…”

“…The verification and validation procedures for the model proposed in this study were performed with the aid of the commercial solver-CPLEX 12.5 [9]. Random values were used to define the demand of each ship and create simulated instances using parameters based on those in [9,24].…”

Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan

“…Robenek, et al [19] presented an integrated model of berth allocation and yard assignment problems in bulk material ports, where a branch-and-price algorithm was designed to obtain exact solutions for small instances and a heuristic critical-shaking neighborhood search to find solutions quickly for large instances. Menezes, et al [14,15] considered an integrated production planning and scheduling problem in bulk cargo to define the amounts and the routes of products from the supply nodes to the terminal. Hu and Yao [7] discussed a reclaimer scheduling problem in the bulk material terminal.…”