Uncapacitated multi-item lot sizing with shipment minimization

Companies often order multiple items from suppliers. There can be environmental and economic benefits from combining these orders. Based on a company case, we formulate the problem of determining in which periods orders for multiple items should be placed to minimize the sum of the order and inventory costs. As a second objective, the goal is to limit the number of shipment periods and we measure the impact of varying this number. We call this problem the Bi-objective Lot Sizing Problem with Shipment Minimization (BLSPSM). This problem combines an overarching problem, namely the determination of shipment periods, with subproblems for each item, namely the determination of order periods and order quantities. We develop so-called bi-level dynamic programming heuristics for the BLSPSM, where the bi-level nature of the problem is exploited. We find efficient frontiers very close to the optimal ones for all instances in our test set. Moreover, we show that our heuristic performs well on the Dynamic Joint Replenishment Problem, a special case of BLSPSM and a known problem in the literature. • Bi-objective problem with minimization of number of shipments and lot-sizing costs. • Problem is based on case study from practice. • Development of novel bi-level dynamic programming heuristics. • Heuristics also provide good solutions to Dynamic Joint Replenishment Problem. • Heuristics perform very well on benchmark instances.