This paper studies the problem of capacitated lot-sizing and scheduling in job shops with a
carryover set-up and a general product structure. After analyzing the literature, the …

In this paper the capacitated lot sizing and scheduling problem with sequence-dependent
setups, setup carryover, and backlogging has been studied. The problem can be formulated …

In this paper, we propose a new algorithmic approach to solve the large-sized instances of
lot-sizing problem in capacitated pure flow shops with sequence-dependent setups within a …

In this research, we formulate and solve a type of the capacitated lot-sizing (CLS) problem.
This problem is commonly found in many manufacturing settings. Unlike a typical …

The capacitated lot sizing problem with setup carryover deals with the issue of planning
multiple products on a single machine. A setup can be carried over from one period to the …

This paper considers a single machine capacitated lot-sizing and scheduling problem. The
problem is to determine the lot sizes and the sequence of lots while satisfying the demand …

Purpose The capacitated lot sizing problem (CLSP) is one of the most important production
planning problems which has been widely studied in lot sizing literature. The CLSP is the …

This paper proposes a genetic algorithm-based heuristic for the capacitated lotsizing
problem in flow shops with sequence-dependent setups. The proposed heuristic combines …

The classical capacitated lot sizing problem is shown to be NP-hard for even a single item
problem. This study deals with an extended version of this problem with setup carryover and …

In this paper, we propose a mixed integer programming (MIP) model for a multi-level multi
resource capacitated lot sizing and scheduling problem with a set of constraints to track …