Abstract
Scheduling multiple products with limited resources and varying demands remain a critical challenge formany industries. This work presents mixed integer programs(MIPs) that solve the Economic Lot SizingProblem (ELSP) and other Dynamic Lot-Sizing (DLS) models with multiple items. DLS systems are clas-sified, extended and formulated as MIPs. Especially, logical constraints are a key ingredient in succeedingin this endeavour. They were used to formulate the setup/changeover of items in the production line. Min-imising the holding, shortage and setup costs is the primaryobjective for ELSPs. This is achieved by findingan optimal production schedule taking into account the limited manufacturing capacity. Case studies for aproduction plants are used to demonstrate the functionality of the MIPs. Optimal DLS and ELSP solutionsare given for a set of test-instances. Insights into the runtime and solution quality are given.