Please use this identifier to cite or link to this item:
https://dair.nps.edu/handle/123456789/2154
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeff Bogdanovich | |
dc.contributor.author | Marc LaNore | |
dc.date.accessioned | 2020-03-16T18:08:31Z | - |
dc.date.available | 2020-03-16T18:08:31Z | - |
dc.date.issued | 2014-12-04 | |
dc.identifier.citation | Published--Unlimited Distribution | |
dc.identifier.uri | https://dair.nps.edu/handle/123456789/2154 | - |
dc.description | Logistic Management / Graduate Student Research | |
dc.description.abstract | The Defense Logistics Agency (DLA) updates its demand forecasts and creates orders to replenish aviation hardware inventory levels once each month. The current system creates cyclical shortages in demand planning staff due to monthly spikes in forecasting and purchase order activities. These staffing shortfalls could be reduced or eliminated if the workload were more evenly distributed over time. The project goal is to determine the optimal forecast interval (time between forecast updates) and duration (length of forecast) such that monthly workload variation among the DLA's purchasing staff is minimized, subject to the constraint of satisfying customer order requirements. The measure of effectiveness is the extent to which workload variations are reduced over time compared to the status quo. | |
dc.description.sponsorship | Acquisition Research Program | |
dc.language | English (United States) | |
dc.publisher | Acquisition Research Program | |
dc.relation.ispartofseries | Workload Distribution | |
dc.relation.ispartofseries | NPS-LM-14-210 | |
dc.subject | Staffing | |
dc.subject | Workload Distributions | |
dc.title | Optimal Demand Execution Strategy for the Defense Logistics Agency | |
dc.type | Technical Report | |
Appears in Collections: | NPS Graduate Student Theses & Reports |
Files in This Item:
File | Size | Format | |
---|---|---|---|
NPS-LM-14-210.pdf | 811.01 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.