Minimum cost allocation of supply centers with limitation on time delivery

Article Abstract:

An algorithm which provides a subset of supply nodes at minimum cost with lessened delivery time is used for solving a problem regarding optimal warehouse location for an inventory distribution network. This is called allocation of supply center in limited time (ASCLT). Nodes are considered as demand points and candidate supply points. The method allows for ease in application with existing supply points.

Analysis, Usage, Algorithms, Cost (Economics), Costs (Economics)

---

A dynamic game model for distribution problems with non-stochastic uncertainty

Article Abstract:

The problem of satisfying the demand for a single commodity with varying and uncertain demand using a discrete-time, single-item, dynamic distribution system consisting of several manufacturing facilities, depots and warehouses was examined. To this end, the system is modeled as a dynamic game between two players on a network with time-varying storage and transportation capacity constraints.

Inventory Control, Research, Models, Distribution of goods, Distribution (Commerce), Production control

---

Similar abstracts:

• Abstracts: Optimal solution of a total time distribution problem. Inventory allocation and customer travelling problem in spatial duopoly
• Abstracts: Fuzzy models for the newsboy problem. On the suboptimality of (S-1,S) lost sales inventory policies. Batching policies for a product life cycle
• Abstracts: Fuzzy models for the newsboy problem. EOQ formula when inventory cost is fuzzy

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.