A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Application of an improved Lagrangian relaxation approach in the constrained long-term production scheduling problem under grade uncertainty
2020
Figshare
In open-pit mines, the long-term production scheduling (LTPS) problem is a mixed-integer programming problem and is considered as a class of NP-hard problems that has to be solved in a reasonably small time owing to the operational requirements. The LTPS problem cannot be considered a well-solved problem. The current article presents hybrid models to elucidate the LTPS problem regarding grade uncertainty with the involvement of Lagrangian relaxation and augmented Lagrangian relaxation (ALR)
doi:10.6084/m9.figshare.12136278.v1
fatcat:wtzdfxlnkncsxjidy7ix5wxpx4