A Heuristic for Multi-Echelon Multi-Indentured Inventory Problems.
ARMY INVENTORY RESEARCH OFFICE PHILADELPHIA PA
Pagination or Media Count:
This report presents a heuristic for solving multi-echelon multi-indentured inventory problems. These problems generally have complex solution procedures that consume considerable amounts of computation time and the procedures are usually difficult to implement. The heuristic we present is easily implemented and provides near optimal solutions quickly. The heuristic has been used successfully on two echelon, two levels of indenture inventory problems. It is easily extendable to more levels of indenture and research is now being done to determine if the heuristic can also be extended to more echelons. Author
- Numerical Mathematics
- Logistics, Military Facilities and Supplies