Author(s)

Renduchintala Raghavendra Kumar Sharma, Priyank Sinha, Mananjay Kumar Verma

Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India.

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 backorder variable) or increasing the number of constraints (time capacity constraints) in the standard problem formulation. These reformulations are expected to reduce the computational time complexity of the problem. Their computational efficiency is evaluated later in this article through numerical analysis on randomly generated problems.

Capacitated Lot Sizing Problem, Efficient Problem Formulation, Branch and Bound

Sharma, R. , Sinha, P. and Verma, M. (2018) Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem. American Journal of Operations Research, 8, 312-322. doi: 10.4236/ajor.2018.84018.