A decomposed resolution technique for the cyclic economic lot-sizing and scheduling problem

Abstract

A cyclic economic lot-sizing and scheduling problem (CELSP) is formulated to solve a multistage production planning problem in a job-shop. The cyclic nature of the problem is related to the a priori assumption of constant demand rates for all the end-products. Under the common cycle approach, each generic job consists of producing an associated end-product in the quantity required to meet the demand over the common cycle horizon. The paper shows that the CESLP can be solved in a decomposed way and that its solution can easily be implemented and adjusted to limited variations of demands.