This thesis, Analysis and Optimization of a Mining and Manufacturing Operation, was written at the hypothetical request of management from the hypothetical Star Light Mining and Manufacturing Corporation. In essence, the problem proposed by Star Light Corporation is a job-scheduling problem that arises when a new production plant and mining shaft system is considered. This site will have all employees working as either a miner in the shaft system, a manufacturer in the plant, or a guard in either location. The objective of this research is to maximize profit and safety while minimizing guard to worker ratio and production machine use of time. In addition, several optional plans are also discussed in this document. Using basic linear and integer optimization methods, such as branch and return (also known as branch and bound) programming, the most profitable combination of 17 miners, 1 manufacturer, and 32 guards was found using the optional plan that includes advanced training for all miners.
","abstract_html":"<p>This thesis, Analysis and Optimization of a Mining and Manufacturing Operation, was written at the hypothetical request of management from the hypothetical Star Light Mining and Manufacturing Corporation. In essence, the problem proposed by Star Light Corporation is a job-scheduling problem that arises when a new production plant and mining shaft system is considered. This site will have all employees working as either a miner in the shaft system, a manufacturer in the plant, or a guard in either location. The objective of this research is to maximize profit and safety while minimizing guard to worker ratio and production machine use of time. In addition, several optional plans are also discussed in this document. Using basic linear and integer optimization methods, such as branch and return (also known as branch and bound) programming, the most profitable combination of 17 miners, 1 manufacturer, and 32 guards was found using the optional plan that includes advanced training for all miners.</p>","abstract_has_math":false,"creators":["Cooper, Daniel Scott"],"institution":null,"degree_name":"Master of Science","degree_level":"Thesis (restricted to Georgia Southern)","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Richard Hathaway","Liancheng Wang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004-01-01T08:00:00Z","date_published":"2004-01-01T08:00:00Z","updated_at":"2026-07-24T02:28:15Z","subjects":["ETD","Mining operation","Manufacturing operation","Optimization methods","Mining safety","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.georgiasouthern.edu/etd_legacy/267","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Richard Hathaway","Liancheng Wang"]},{"key":"dc:creator","label":"Author","values":["Cooper, Daniel Scott"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["1970-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis (restricted to Georgia Southern)"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["ETD","Mining operation","Manufacturing operation","Optimization methods","Mining safety","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.georgiasouthern.edu/etd_legacy/267"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis, Analysis and Optimization of a Mining and Manufacturing Operation, was written at the hypothetical request of management from the hypothetical Star Light Mining and Manufacturing Corporation. In essence, the problem proposed by Star Light Corporation is a job-scheduling problem that arises when a new production plant and mining shaft system is considered. This site will have all employees working as either a miner in the shaft system, a manufacturer in the plant, or a guard in either location. The objective of this research is to maximize profit and safety while minimizing guard to worker ratio and production machine use of time. In addition, several optional plans are also discussed in this document. Using basic linear and integer optimization methods, such as branch and return (also known as branch and bound) programming, the most profitable combination of 17 miners, 1 manufacturer, and 32 guards was found using the optional plan that includes advanced training for all miners.
"]},{"key":"dc:title","label":"Title","values":["Analysis and Optimization of a Mining and Manufacturing Operation"]}]}],"canonical_facts":{"dc:contributor":["Richard Hathaway","Liancheng Wang"],"dc:creator":["Cooper, Daniel Scott"],"dc:date.available":["1970-01-01T08:00:00Z"],"dc:description.abstract":["This thesis, Analysis and Optimization of a Mining and Manufacturing Operation, was written at the hypothetical request of management from the hypothetical Star Light Mining and Manufacturing Corporation. In essence, the problem proposed by Star Light Corporation is a job-scheduling problem that arises when a new production plant and mining shaft system is considered. This site will have all employees working as either a miner in the shaft system, a manufacturer in the plant, or a guard in either location. The objective of this research is to maximize profit and safety while minimizing guard to worker ratio and production machine use of time. In addition, several optional plans are also discussed in this document. Using basic linear and integer optimization methods, such as branch and return (also known as branch and bound) programming, the most profitable combination of 17 miners, 1 manufacturer, and 32 guards was found using the optional plan that includes advanced training for all miners.
"],"dc:identifier":["https://digitalcommons.georgiasouthern.edu/etd_legacy/267"],"dc:subject":["ETD","Mining operation","Manufacturing operation","Optimization methods","Mining safety","Mathematics"],"dc:title":["Analysis and Optimization of a Mining and Manufacturing Operation"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Thesis (restricted to Georgia Southern)"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T02:28:15Z"}