A Lagrangean relaxation approach for capacitated lot sizing problem with setup times. (1st January 2013)

• Record Type: Journal Article
• Authors: Cheng, Chun-Hung; Madan, Manohar S.; Motwani, Jaideep; Yip, Ka-Yun
• Is Part Of: International journal of operational research. Volume 18:Number 3(2013)
• Page Start: 272
• Page End: 303
• Publication Date: 2013-01-01
• Subjects: production planning -- lot sizing problem -- Lagrangean relaxation; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

Abstract

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 capacity constraints. This problem is commonly referred to as the capacitated lot sizing (CLS) problem. We develop a model that explicitly considers setup times for products and different types of production capacities such as regular time and overtime. We develop a heuristic based on Lagrangian relaxation to solve this CLS problem. Computational results show that our algorithm gives reliable results while comparing solution values to lower bounds.