Pages that link to "Item:Q1752798"
From MaRDI portal
The following pages link to A local branching heuristic for the open pit mine production scheduling problem (Q1752798):
Displaying 13 items.
- Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
- Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty (Q322445) (← links)
- A sliding time window heuristic for open pit mine block sequencing (Q691428) (← links)
- The new Fundamental Tree Algorithm for production scheduling of open pit mines (Q856303) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- An application of branch and cut to open pit mine scheduling (Q1407258) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (Q1926975) (← links)
- A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem (Q2160495) (← links)
- Solution procedures for block selection and sequencing in flat-bedded potash underground mines (Q2241902) (← links)
- Production planning and scheduling in mining scenarios under IPCC mining systems (Q2289898) (← links)
- Constructing branching trees of geostatistical simulations (Q2676486) (← links)
- A real-world mine excavators timetabling methodology in open-pit mining (Q6050355) (← links)
