An Algorithm for Computing Optimum Stock Levels in a Two-Level Maintenance System.

reportActive / Technical Report | Accession Number: ADA328176 | Open PDF

Abstract:

An optimization algorithm for a multi-echelon model is given which does not assume convexity. The algorithm employs a bound technique to determine a finite search area. Updating the bound is used to increase the efficiency.

Author(s):
Kruse, W. K.
Author Organization(s):
ARMY LOGISTICS MANAGEMENT CENTER FORT LEE VA
Descriptive Note:
Technical rept.,
Supplementary Note:
DOI: 10.21236/ADA328176
Pagination:
0018

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Monitor Series:
USALMC
 Subject Terms
Joint Capability Areas:
JCA_3_Force Application; JCA_4.3_Maintain; JCA_5_Command and Control; JCA_4_Logistics; JCA_3.1.1_Maneuver to Engage; JCA_3.1_Maneuver; JCA_4.6.1_General Engineering; JCA_4.6_Engineering; JCA_3.2_Engagement; JCA_1_Force Support; JCA_3.2.1_Kinetic Means; JCA_1.2_Force Preparation
Communities of Interest:
Weapons Technologies
Descriptor(s):
*MATHEMATICAL MODELS, *INVENTORY CONTROL, ALGORITHMS, OPTIMIZATION, COSTS, MATHEMATICAL PREDICTION, MAINTENANCE MANAGEMENT
Field(s)/Group(s):
Logistics, Military Facilities and Supplies
Keyword(s):
DIFFERENTIATION
Report Date:
1970 Jan 01
Creation Date:
1997 Nov 12