Joint Multi-item Storage Location Assignment Capacitated Lot Sizing Problem

摘要

This research develops and solves a mathematical model that combines a dynamic storage location assignment problem with a multi-item capacitated lot sizing problem. The joint multi-item storage location assignment capacitated lot sizing problem aims to model a production warehouse coordinating production with warehouse layout. It examines when to produce an item and how much to produce, then once the item is produced where to place the item in the warehouse. This problem was formulated as a mixed integer program and the objective function was to minimize the costs of production, setup, storage/ retrieval, and handling, and also to implement a dedicated storage assignment policy. In order to solve the model GAMS was used as the modeling language and Cplex as the optimization solver for small, medium and large problem instances and the results were reported.