메뉴 건너뛰기




Volumn 27, Issue 2-3, 2003, Pages 349-365

An application of branch and cut to open pit mine scheduling

Author keywords

Branch and Cut; Mine Scheduling; Mixed Integer Linear Programming; Optimization

Indexed keywords

GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

EID: 0042929889     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024835022186     Document Type: Conference Paper
Times cited : (243)

References (40)
  • 4
    • 0003875064 scopus 로고
    • Computational results with a branch and cut code for the capacitated vehicle routing problem
    • Universite Joseph Fourier, Grenoble, France,.
    • Augerat, P., Belengeur, J.M., Benavent, E., Corberan, A., Naddef, N. and Rinaldi, G. (1995) Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France,.
    • (1995) Research Report , vol.949 M
    • Augerat, P.1    Belengeur, J.M.2    Benavent, E.3    Corberan, A.4    Naddef, N.5    Rinaldi, G.6
  • 5
    • 0042709238 scopus 로고    scopus 로고
    • Autoscheduler
    • Autoscheduler, Runge Mining Pty Ltd. (Australia). Web: http//www.runge.com/xpac.
  • 6
    • 0020985077 scopus 로고
    • Parametization of optimal designs of an open pit beginning of a new phase of research
    • Francois-Bongarcon, D.M. and Guibal, D. (1984), Parametization of Optimal Designs of an Open Pit Beginning of a New Phase of Research, Trans. SME, AIME 274, 1801-1805.
    • (1984) Trans. SME, AIME , vol.274 , pp. 1801-1805
    • Francois-Bongarcon, D.M.1    Guibal, D.2
  • 8
    • 0024069402 scopus 로고
    • An application of discrete mathematics in the design of an open pit mine
    • Caccetta, L. and Giannini, L.M. (1988), An Application of Discrete Mathematics in the Design of an Open Pit Mine, Discrete Applied Mathematics 21, 1-19.
    • (1988) Discrete Applied Mathematics , vol.21 , pp. 1-19
    • Caccetta, L.1    Giannini, L.M.2
  • 9
    • 0042208062 scopus 로고
    • Application of operations research techniques in open pit mining
    • Byong-Hun Ahn (Ed.), Elsevier Science Publishers BV
    • Caccetta, L. and Giannini, L.M. (1990), Application of Operations Research Techniques in Open Pit Mining, in Byong-Hun Ahn (Ed.), Asian-Pacific Operations Research: APORS'88, Elsevier Science Publishers BV, pp. 707-724.
    • (1990) Asian-Pacific Operations Research: APORS'88 , pp. 707-724
    • Caccetta, L.1    Giannini, L.M.2
  • 13
    • 0035286016 scopus 로고    scopus 로고
    • A branch and cut method for the degree constrained minimum spanning tree problem
    • Caccetta, L. and Hill, S.P. (2001), A Branch and Cut Method for the Degree Constrained Minimum Spanning Tree Problem, Networks 37, 74-83.
    • (2001) Networks , vol.37 , pp. 74-83
    • Caccetta, L.1    Hill, S.P.2
  • 16
    • 0041707641 scopus 로고    scopus 로고
    • ILOG Inc., CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, U.S.A.
    • CPLEX 6.0 User Manual, ILOG Inc., CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, U.S.A.
    • CPLEX 6.0 User Manual
  • 20
    • 0042709235 scopus 로고    scopus 로고
    • Earthworks, NPV Scheduler, Web: http://www.earthworks.com.au.
    • NPV Scheduler
  • 22
    • 0020735786 scopus 로고
    • Mine scheduling optimization with mixed integer programming
    • Gershon, M. (1983), Mine Scheduling Optimization with Mixed Integer Programming, Mining Engineering 35, 351-354.
    • (1983) Mining Engineering , vol.35 , pp. 351-354
    • Gershon, M.1
  • 23
    • 0012299968 scopus 로고
    • Heuristic approaches for mine planning and production scheduling
    • Gershon, M. (1987), Heuristic Approaches for Mine Planning and Production Scheduling, Int. Journal of Mining and Geological Engineering 5, 1-13.
    • (1987) Int. Journal of Mining and Geological Engineering , vol.5 , pp. 1-13
    • Gershon, M.1
  • 25
    • 0027614308 scopus 로고
    • Solving airline crew scheduling problems by branch and cut
    • Huffman, K.L. and Padberg, M.W. (1993), Solving Airline Crew Scheduling Problems by Branch and Cut, Management Science 39, 657-682.
    • (1993) Management Science , vol.39 , pp. 657-682
    • Huffman, K.L.1    Padberg, M.W.2
  • 26
    • 0043210308 scopus 로고
    • Open-pit limits analysis: Technical overview
    • A. Weiss (Ed.), AIME, New York
    • Kim, Y.C. (1979), Open-Pit Limits Analysis: Technical Overview, in: A. Weiss (Ed.), Computer Methods for the 80's (AIME, New York), pp. 297-303.
    • (1979) Computer Methods for the 80's , pp. 297-303
    • Kim, Y.C.1
  • 27
    • 0041707616 scopus 로고
    • Production scheduling: Technical overview
    • A. Weiss, (Ed.), AIME, New York
    • Kim, Y.C. (1979), Production Scheduling: Technical Overview, in: A. Weiss, (Ed.), Computer Methods for the 80's (AIME, New York) pp. 610-614.
    • (1979) Computer Methods for the 80's , pp. 610-614
    • Kim, Y.C.1
  • 29
    • 0009817739 scopus 로고
    • Le parametrage des contours optimaux
    • Centre de Geostatistiques, Fontainebleau, France
    • Matheron, G. (1975), Le Parametrage des Contours Optimaux, Technical Report No. 403, Centre de Geostatistiques, Fontainebleau, France.
    • (1975) Technical Report No. 403 , vol.403
    • Matheron, G.1
  • 30
    • 0041707639 scopus 로고
    • Le parametrage technique des reseues
    • Centre de Geostatistiques, Fontainebleau, France
    • Matheron, G. (1975), Le Parametrage Technique des Reseues, Technical Report No. 453, Centre de Geostatistiques, Fontainebleau, France.
    • (1975) Technical Report No. 453 , vol.453
    • Matheron, G.1
  • 31
    • 0043210327 scopus 로고    scopus 로고
    • MineMax, Combinatorics Pty Ltd, Unit 4b, R&D Centre, 1 Sarich Way, Bentley, Western Australia, 6102
    • MineMax, Combinatorics Pty Ltd, Unit 4b, R&D Centre, 1 Sarich Way, Bentley, Western Australia, 6102.
  • 32
    • 0026124209 scopus 로고
    • A branch and cut algorithm for the resolution of large scale travelling salesman problems
    • Padberg, M. and Rinaldi, G. (1991), A Branch and Cut Algorithm for the Resolution of Large Scale Travelling Salesman Problems, SIAM Review 33(1), 60-100.
    • (1991) SIAM Review , vol.33 , Issue.1 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 33
    • 0016972463 scopus 로고
    • Maximum closure of a graph and applications to combinatorial problems
    • Picard, J.C. (1976), Maximum Closure of a Graph and Applications to Combinatorial Problems, Management Sc. 22, 1268-1272.
    • (1976) Management Sc. , vol.22 , pp. 1268-1272
    • Picard, J.C.1
  • 37
    • 0041707636 scopus 로고
    • Whittle Programming Pty Ltd., Melbourne, Australia
    • Whittle, J. (1993), Four-D User Manual, Whittle Programming Pty Ltd., Melbourne, Australia.
    • (1993) Four-D User Manual
    • Whittle, J.1
  • 38
    • 0041707614 scopus 로고    scopus 로고
    • Whittle Programming Pty Ltd., Melbourne, Australia
    • Whittle, J. (1998), Four-X User Manual, Whittle Programming Pty Ltd., Melbourne, Australia.
    • (1998) Four-X User Manual
    • Whittle, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.