Conference proceeding
New heuristics for lot sizing problems with variable unit costs
Proceedings - Annual Meeting of the Decision Sciences Institute, Vol.3, pp.1549-1551
1996
Abstract
We present lot-sizing heuristics that are both efficient and stable for the dynamic lot-sizing problem (DLSP) with constant or variable unit costs, including setup, inventory holding and production costs. These heuristics are myopic variants of the forward Wagner-Whitin algorithm with rolling horizons. Large scale computational experiments show that these heuristics considerably outperform other well known stable heuristics and produce close-to-optimal solutions for DLSP with general unit costs.
Details
- Title: Subtitle
- New heuristics for lot sizing problems with variable unit costs
- Creators
- Tianbing Qian - University of IowaPhilip C. Jones - Univ of Iowa, United States
- Resource Type
- Conference proceeding
- Publication Details
- Proceedings - Annual Meeting of the Decision Sciences Institute, Vol.3, pp.1549-1551
- Language
- English
- Date published
- 1996
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963204002771
Metrics
1 Record Views