Using marginal analysis to load Combat Logistics Force (CLF) ships
Wilson, K. Craig
Fields, Paul J.
Terasawa, Katsuaki L.
MetadataShow full item record
This thesis provides an algorithm based on marginal analysis to help CLF Supply Officers load ships with Provisions (food), High Usage Load List (HULL), and ship store stock. The algorithm is incorporated into an EXCEL spreadsheet and produces a prioritized list of items in their optimum stocking sequence. The algorithm is compared to both the Atlantic and Pacific Fleet current loading methods using a food item example and shows a 60-70% increase in expected supply effectiveness. Furthermore, the algorithm is generic and can be applied to any inventory problem where a demand distribution is known and space is the limiting factor in determining stocking levels.
RightsThis 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.
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Tan, Ko-Cheng (Monterey, California. Naval Postgraduate School, 1996-06);Motion planning and control of a Nomad 200 mobile robot are studied in this thesis. The objective is to develop a motion planning and control algorithm that is able to move the robot from an initial configuration (position ...