{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/54807"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/54807","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Long-term scheduling in underground coal mining using mixed binary programming","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["West-Hansen, Jan"],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Ph. D.","degree_level":"doctoral","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":["Sarin, Subhash C."],"committee_members":["Adel, Gregory T.","Freeman, H. J.","Sherali, Hanif","Suboleski, Stanley C."],"year":1989,"date_issued":"1989","date_published":"1989","updated_at":"2026-07-22T22:20:05Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/54807","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Sarin, Subhash C."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Adel, Gregory T.","Freeman, H. J.","Sherali, Hanif","Suboleski, Stanley C."]},{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["West-Hansen, Jan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-07-28T19:21:24Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-07-28T19:21:24Z"]},{"key":"dc:date.issued","label":"Date","values":["1989"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/54807"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Long-term scheduling in underground coal mining using mixed binary programming"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Sarin, Subhash C."],"dc:contributor.committeemember":["Adel, Gregory T.","Freeman, H. J.","Sherali, Hanif","Suboleski, Stanley C."],"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["West-Hansen, Jan"],"dc:date.accessioned":["2015-07-28T19:21:24Z"],"dc:date.available":["2015-07-28T19:21:24Z"],"dc:date.issued":["1989"],"dc:description.abstract":["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."],"dc:description.degree":["Ph. D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/54807"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Long-term scheduling in underground coal mining using mixed binary programming"],"dc:type":["Dissertation"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph. D."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:20:05Z"}