{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/999"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/999","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"Enhancing persistence when optimally scheduling depot-level repair activity for the United States Marine Corps","abstract":"The United States Marine Corps' ability to wage war and its warfighting effectiveness rely heavily on the availability of its tactical ground equipment. The Marine Corps optimizes the warfighting availability of its tactical ground equipment in its depot-level repair plan, which commits $450 million over a six-year horizon. Currently, small changes (for example, budget) to the input to this model produce non-intuitive revisions that are needlessly disruptive. The Marine Corps Materiel Command (MATCOM) recognizes this problem and has asked for enhancement of their current model to include persistent features. We show that turbulence can be reduced at little cost in warfighting availability. We also investigate an approximate, but very fast heuristic in lieu of mathematical optimization to solve this problem. A simple greedy myopic heuristic quickly produces nearly-optimal advice to the depot-level planning problem.","abstract_html":"The United States Marine Corps' ability to wage war and its warfighting effectiveness rely heavily on the availability of its tactical ground equipment. The Marine Corps optimizes the warfighting availability of its tactical ground equipment in its depot-level repair plan, which commits $450 million over a six-year horizon. Currently, small changes (for example, budget) to the input to this model produce non-intuitive revisions that are needlessly disruptive. The Marine Corps Materiel Command (MATCOM) recognizes this problem and has asked for enhancement of their current model to include persistent features. We show that turbulence can be reduced at little cost in warfighting availability. We also investigate an approximate, but very fast heuristic in lieu of mathematical optimization to solve this problem. A simple greedy myopic heuristic quickly produces nearly-optimal advice to the depot-level planning problem.","abstract_has_math":false,"creators":["Drexler, Jonathan A."],"institution":"Monterey, CA; Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Operations Research (OR)","school":null,"contributors":[],"advisors":["Brown, Gerald G."],"committee_chairs":[],"committee_members":[],"year":2003,"date_issued":"2003-06","date_published":"2003-06","updated_at":"2026-07-27T20:24:57Z","subjects":[],"languages":[],"rights":["This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/999","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Brown, Gerald G."]},{"key":"dc:contributor.department","label":"Department","values":["Operations Research (OR)"]},{"key":"dc:creator","label":"Author","values":["Drexler, Jonathan A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-03-14T17:30:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-03-14T17:30:12Z"]},{"key":"dc:date.issued","label":"Date","values":["2003-06"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, CA; Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/999"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The United States Marine Corps' ability to wage war and its warfighting effectiveness rely heavily on the availability of its tactical ground equipment. The Marine Corps optimizes the warfighting availability of its tactical ground equipment in its depot-level repair plan, which commits $450 million over a six-year horizon. Currently, small changes (for example, budget) to the input to this model produce non-intuitive revisions that are needlessly disruptive. The Marine Corps Materiel Command (MATCOM) recognizes this problem and has asked for enhancement of their current model to include persistent features. We show that turbulence can be reduced at little cost in warfighting availability. We also investigate an approximate, but very fast heuristic in lieu of mathematical optimization to solve this problem. A simple greedy myopic heuristic quickly produces nearly-optimal advice to the depot-level planning problem."]},{"key":"dc:title","label":"Title","values":["Enhancing persistence when optimally scheduling depot-level repair activity for the United States Marine Corps"]}]}],"canonical_facts":{"dc:contributor.advisor":["Brown, Gerald G."],"dc:contributor.department":["Operations Research (OR)"],"dc:creator":["Drexler, Jonathan A."],"dc:date.accessioned":["2012-03-14T17:30:12Z"],"dc:date.available":["2012-03-14T17:30:12Z"],"dc:date.issued":["2003-06"],"dc:description.abstract":["The United States Marine Corps' ability to wage war and its warfighting effectiveness rely heavily on the availability of its tactical ground equipment. The Marine Corps optimizes the warfighting availability of its tactical ground equipment in its depot-level repair plan, which commits $450 million over a six-year horizon. Currently, small changes (for example, budget) to the input to this model produce non-intuitive revisions that are needlessly disruptive. The Marine Corps Materiel Command (MATCOM) recognizes this problem and has asked for enhancement of their current model to include persistent features. We show that turbulence can be reduced at little cost in warfighting availability. We also investigate an approximate, but very fast heuristic in lieu of mathematical optimization to solve this problem. A simple greedy myopic heuristic quickly produces nearly-optimal advice to the depot-level planning problem."],"dc:identifier.uri":["https://hdl.handle.net/10945/999"],"dc:publisher":["Monterey, CA; Naval Postgraduate School"],"dc:rights":["This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States."],"dc:title":["Enhancing persistence when optimally scheduling depot-level repair activity for the United States Marine Corps"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:24:57Z"}