Suchergebnisse

AbstractThe chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i‐th stock ni should usually be allocated in proportion to the i‐th demand mi; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)magnified image.For problem (2), the article gives specific bounds on intensity of demand, for deciding when an item in low demand should be stocked at a central rather than a branch warehouse.

"May 1972." ; Cover title. ; Mode of access: Internet. ; 2

AbstractIn this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000

Background -- Exploration and military operations in the Lower Yellowstone and Powder River country, 1805-1875 -- The 1876 Sioux War to the beginning of white settlement -- Events of the 1876 Sioux War at the mouth of Powder River -- Archaeology and history at the Powder River Depot -- Conclusions