Abstract
In this research, we formulate and solve a type of the capacitated lotsizing (CLS) problem. This problem is commonly found in many manufacturing settings. Unlike a typical formulation, our formulation explicitly considers different types of production capacities such as regular time and overtime. We develop a heuristic based on Lagrangean relaxation with a decomposition scheme to solve this CLS problem. Computational results show that our algorithm gives very good results while comparing to lower bounds.
Original language | English (US) |
---|---|
Pages (from-to) | 205-232 |
Number of pages | 28 |
Journal | International Journal of Mathematics in Operational Research |
Volume | 2 |
Issue number | 2 |
DOIs | |
State | Published - Jan 2010 |
All Science Journal Classification (ASJC) codes
- General Decision Sciences
- Modeling and Simulation