The long-term mine production scheduling problem

IIE Transactions (Institute of Industrial Engineers)

Volumn 37, Issue 2, 2005, Pages 109-121

  Sarin, Subhash C ^a   West Hansen, Jan ^a,b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b SEL Softwork GmbH and Co   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COAL MINES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PRODUCTIVITY; SCHEDULING;

MIXED BINARY PROGRAMMING MODEL; PRODUCTION SCHEDULING PROBLEM;

PRODUCTION ENGINEERING;

EID: 11844254419     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490447339     Document Type: Article

References (17)

1. Bazaraa, M.S. and Sherali, H.D. (1980) Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Research Logistics Quarterly, 27(1), 29-41.
2. Benders, J.F. (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(3), 238-252.
3. Brucker, P. (1998) Scheduling Algorithms, Springer-Verlag, Berlin, Germany.
4. Bucklen, E.R., Lucas, J.R., Prelaz, L.J. and Suboleski, S.C. (1968) Computer applications in underground mining systems. Office of Coal Research, US Department of the Interior, Report No. 37, Washington, DC.
5. Crickmer, D.F. and Zegeer, D.A. (eds.) (1981) Elements of Practical Coal Mining, SME-AIME, New York, NY.
6. Fisher, M.L. (1981) The Lagrangian relaxation method for solving integer programming problems. Management Science, 37(1), 1-18.
7. Ibaraki, T. (1981) Solving mathematical programming problems with fractional objective functions, in Generalized Concavity in Optimization and Economics, Academic Press, New York. NY. pp. 32-47.
8. Lasdon, L.S. (1970) Optimization Theory for Large Systems, MacMillan, New York. NY.
9. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B. (1993) Sequencing and scheduling: algorithms and complexity, in Handbooks in OR & MS. vol. 4, Graves, S.C. et al (eds.), Elsevier, North Holland, New York, pp. 445-522.
10. Morton, T.E. and Dharan, B.G. (1978) Algoristics for single-machine sequencing with precedence constraints. Management Science, 24 10), 1011-1020.
11. Myers, D.C (1984) The design of branch and bound, Lagrangian relaxation and subgradient optimization strategies for mixed integer programming problems. Ph.D. Dissertation. Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA.
12. Pinedo, M. (2002) Scheduling, Theory, Algorithms and Systems, Prentice Hall, Upper Saddle River, NJ.
13. Sarin, S.C. and Elmaghraby, S.E. (1984) Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines. International Journal of Production Research, 22(1), 17-30.
14. Smith, W.E. (1956) Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1&2), 59-66.
15. West-Hansen, J. and Sarin, S.C. (2000) An improved heuristic for scheduling precedence-related jobs on parallel processors. Research Report, Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA 24061. USA.
16. West-Hansen, J., Topuz, E. and Sarin, S.C. (1986) Long-term production scheduling in underground coal mines - an application of sequencing theory, in Proceedings of the 19th International Symposium on the Application of Computers and Operations Research in the Mineral Industry Society of Mining Engineers, CO. pp. 10-16.
17. Williams, H.E (1974) Experiments in the formulation of integer programming problems, in Mathematical Programming Study 2, North-Holland, New York, NY.