Abstract
We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that can be employed on a wide range of problems; on data sets arising in the mining industry our algorithms prove effective on problems with many millions of variables and constraints, obtaining provably optimal solutions in a few minutes of computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balinsky, M.L.: On a selection problem. Management Science 17, 230–231 (1970)
Barahona, F., Anbil, R.: The Volume Algorithm: producing primal solutions with a subgradient method. Math. Programming 87, 385–399 (2000)
Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems, Theory and Practice. Kluwer Academic Publishers, Boston (2002), ISBN 1-4020-7173-6
Bienstock, D., Zuckerberg, M.: A new LP algorithm for precedence constrained production scheduling, posted on Optimization Online (August 2009)
Boland, N., Dumitrescu, I., Froyland, G., Gleixner, A.M.: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Computers and Operations Research 36, 1064–1089 (2009)
Caccetta, L., Hill, S.P.: An application of branch and cut to open pit mine scheduling. Journal of Global Optimization 27, 349–365 (2003)
Chandran, B., Hochbaum, D.: A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem. Operations Research 57, 358–376 (2009)
Chicoisne, R., Espinoza, D., Goycoolea, M., Morena, E., Rubio, E.: A New Algorithm for the Open-Pit Mine Scheduling Problem (submitted for publication), http://mgoycool.uai.cl/
Fricke, C.: Applications of integer programming in open pit mine planning, PhD thesis, Department of Mathematics and Statistics, The University of Melbourne (2006)
Hochbaum, D.: The pseudoflow algorithm: a new algorithm for the maximum flow problem. Operations Research 58, 992–1009 (2008)
Hochbaum, D., Chen, A.: Improved planning for the open - pit mining problem. Operations Research 48, 894–914 (2000)
Johnson, T.B.: Optimum open pit mine production scheduling, PhD thesis, Operations Research Department, University of California, Berkeley (1968)
Lerchs, H., Grossman, I.F.: Optimum design of open-pit mines. Transactions C.I.M. 68, 17–24 (1965)
Picard, J.C.: Maximal Closure of a graph and applications to combinatorial problems. Management Science 22, 1268–1272 (1976)
Rhys, J.M.W.: A selection problem of shared fixed costs and network flows. Management Science 17, 200–207 (1970)
Gemcom Software International, Vancouver, BC, Canada
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bienstock, D., Zuckerberg, M. (2010). Solving LP Relaxations of Large-Scale Precedence Constrained Problems. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)