Modelling multi-period set-up times in the proportional lot-sizing problem

Abstract

This paper presents new mixed integer programming models for the Proportional Lot-Sizing Problem (PLSP) with set-up times longer than a period. Proposed models explicitly calculate the distribution of times amongst products in periods with a changeover and determine a final period for every set-up operation. Presented results prove that the proposed models are easier to solve using standard MIP methods than already known models.