Recognizing the complexity of coal mining management, e.g., the scarcity of financial resources and the high level of uncertainty, a mixed binary programming model has been developed as an aid for generating production schedules which maximize the associated net present value.
Defining the mine layout as a precedence network, with the nodes representing mining blocks, a solution procedure is developed, based on Benders' partitioning scheme. That is, the procedure iterates between two problems, namely, the master (primal) problem, solved by a combination of heuristic and exact methods, and the subproblem (dual problem), solved partly by inspection and partly as a minimal cost network flow problem. The heuristic methods are based on improvements of existing algorithms for scheduling precedence-related jobs on m processors.
Computational experiences are presented and the procedure is demonstrated on a mining case. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/54807 |
| Date | January 1989 |
| Creators | West-Hansen, Jan |
| Contributors | Industrial Engineering and Operations Research, Sarin, Subhash C., Adel, Gregory T., Freeman, H. J., Sherali, Hanif, Suboleski, Stanley C. |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Dissertation, Text |
| Format | x, 270 leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 20139872 |
Page generated in 0.0019 seconds