Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem

• 作者: Mananjay Kumar Verma Priyank Sinha Renduchintala Raghavendra Kumar Sharma
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 数学
• 关键词: Capacitated Lot SIZING PROBLEM EFFICIENT PROBLEM FORMULATION Branch and BOUND
• 年，卷（期）: 2018,（4）
• 页码范围: 312-322
• 页数: 11页
• 分类号: O1

摘要

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.