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 …

In this research, we consider a production planning problem that determines the production
timings and quantities for multiple products over a finite number of periods without violating …

Capacitated lot sizing problem (CLSP) finds its applications in manufacturing, production as-
well-as process industries. Typical size of the real life problems is much larger compared to …

In this article, we propose novel reformulations for capacitated lot sizing problem. These
reformulations are the result of reducing the number of variables (by eliminating the …

We propose a novel mixed integer programming formulation for the capacitated lot-sizing
problem with set-up times and set-up carryover. We compare our formulation to two earlier …

Lot sizing is one of the most important and also one of the most difficult problems in
production planning. This subject has been studied extensively in the literature. In this …

In this research, we present a heuristic for the Capacitated Lot-Sizing (CLS) problem without
set-up time considerations and no backordering option. The CLS problem is formulated as a …

Abstract The Capacitated Lot Sizing Problem (CLSP) consists of planning the lot sizes of
multiple items over a planning horizon with the objective of minimizing setup and inventory …

In this research, we formulate and solve a type of the capacitated lot-sizing problem. We
present a general model for the lot-sizing problem with backorder options, that can take into …

This paper presents polynomial time algorithms for three extensions of the classical
capacitated lot sizing problem (CLSP). We consider a constant batch size production with a …