Coordinated Replenishment Strategies in Inventory/Distribution Systems
Management Science
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy
Transportation Science
Two-stage inventory models with a bi-modal transportation cost
Computers and Operations Research
Economic Lot-Sizing for Integrated Production and Transportation
Operations Research
Optimizing replenishment polices using Genetic Algorithm for single-warehouse multi-retailer system
Expert Systems with Applications: An International Journal
Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions
Operations Research Letters
| Hi-index | 0.00 |
We consider a system in which multiple items are transferred from a warehouse or a plant to a retailer through identical capacitated vehicles, or by identical freight wagons. Any mixture of the items may be loaded onto a vehicle. The retailer is facing dynamic deterministic demand for several items, over a finite planning horizon. A vehicle incurs a fixed cost for each trip made from the warehouse to the retailer. In addition, there exist item-dependent variable shipping costs and inventory holding costs at the retailer, which are both constant over time. The objective is to find a shipment schedule that minimizes the total cost, while satisfying demand on time.We address and partially resolve the question regarding the problem's complexity by introducing a dynamic programming algorithm whose complexity is polynomial for a fixed number of items, but exponential otherwise. Our dynamic programming formulation is based on properties satisfied by the optimal solution, and uses an innovative way for partitioning the problem into subproblems.