TITLE:
Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem
AUTHORS:
Renduchintala Raghavendra Kumar Sharma, Priyank Sinha, Mananjay Kumar Verma
KEYWORDS:
Capacitated Lot Sizing Problem, Efficient Problem Formulation, Branch and Bound
JOURNAL NAME:
American Journal of Operations Research,
Vol.8 No.4,
July
18,
2018
ABSTRACT: 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.