Lot sizing problem on a paper machine under a cyclic production approach

In this paper, we address the problem of defining the production campaigns on a paper machine. Each campaign is of a fixed duration (cycle time) and produces batches (lot sizes) of all or a set of the products. This paper presents a real case study discussing a specific lot sizing problem where a predetermined production sequence must be maintained. We propose a new approach where we compute first the cycle time by assuming constant demand, and then lot sizes are determined for each product within each cycle in order to satisfy demand. Finally, studying the context of a Canadian paper maker, we evaluate the impact of planning production under a cycling manner