Economic Lot-Sizing Problem with Multimode Replenishment and Perishable Inventory

摘要

This study extends the classical economic lot-sizing problem to consider that several transportation modes are available and products can be stored for a limited number of time periods. Inventory replenishment costs are represented by a multiple-setups cost function. Cargo capacity constraints are also considered. This problem is modeled as a network flow problem with side constraints. The objective is to identify the timing of an order, order size, and choice of transportation modes that minimize the costs of replenishing perishable inventories. We present an MIP formulation. We propose a primal-dual-based heuristic that provides tight upper and lower bounds.