Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
From MaRDI portal
Publication:2664365
DOI10.1016/j.cor.2020.105036zbMath1458.90250OpenAlexW3037951696MaRDI QIDQ2664365
Alessandro Zanarini, Max Åstrand, Mikael Johansson
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105036
Related Items (4)
A real-world mine excavators timetabling methodology in open-pit mining ⋮ Combining an LNS-based approach and organizational mining for the resource replacement problem ⋮ Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ Short-term scheduling of production fleets in underground mines using CP-based LNS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Machine scheduling in underground mining: an application in the potash industry
- Optimization-based heuristics for underground mine scheduling
- Principles for the design of large neighborhood search
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
- Fleet scheduling in underground mines using constraint programming
- Using constraint programming for solving RCPSP/MAX-cal
- Staff and machine shift scheduling in a German potash mine
- Stochastic short-term mine production schedule accounting for fleet allocation, operational considerations and blending restrictions
- A shortest-path algorithm for solving the fleet management problem in underground mines
- The hybrid flow shop scheduling problem
- A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine
- An enumeration algorithm for solving the fleet management problem in underground mines
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Principles of Constraint Programming
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- Failure-Directed Search for Constraint-Based Scheduling
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Underground mine scheduling of mobile machines using constraint programming and large neighborhood search