Short-term scheduling of production fleets in underground mines using CP-based LNS

DOI10.1007/978-3-030-78230-6_23OpenAlexW3166206299MaRDI QIDQ2117237

Mikael Johansson, Max Åstrand, Hamid Reza Feyzmahdavian

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_23

zbMATH Keywords

schedulingconstraint programminglarge neighborhood searchunderground mining

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Gecode

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Machine scheduling in underground mining: an application in the potash industry
• Optimal speedup of Las Vegas algorithms
• A survey of very large-scale neighborhood search techniques
• Principles for the design of large neighborhood search
• A general heuristic for vehicle routing 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
• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• Staff and machine shift scheduling in a German potash mine
• A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
• Lightweight dynamic symmetry breaking
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search