To cite this paper use one of the standards below:
Ore haulage in open-pit mining is a critical stage of the production process, whose efficient scheduling has a direct impact on productivity and operating costs. The coordination of heterogeneous loading and hauling equipment, subject to capacity constraints, cycle times and multiple dumping points, gives rise to a combinatorial problem whose exact resolution is prohibitive for realistic instances. This work formulates it as a parallel machine scheduling problem with heterogeneous speeds and release times, and proposes five strategies to minimize the makespan: a mixed-integer programming model (MFOHOSM), two constructive heuristics (FIFO and SPT), an insertion-based local search (INSERT) and two tabu search metaheuristics (TSI and TSI-S). Evaluated on real instances from a ferronickel mine in Colombia, TSI achieves competitive GAPs at computation times two orders of magnitude below those of the exact model, positioning itself as a viable alternative for large-scale scenarios.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper