Abstract
The focus of this paper is on connections between lot sizing and cluster analysis. The similarities between integer programming formulations for minimizing the total within-clusters sum of squares in cluster analysis, and the single item uncapacitated lot sizing problem, are discussed. The development of heuristics in cluster analysis is expected to benefit from this comparison.
Original language | Undefined |
---|---|
Pages (from-to) | 65-69 |
Journal | Engineering Costs and Production Economics |
Volume | 12 |
Issue number | 1-4 |
DOIs | |
Publication status | Published - 1987 |
Externally published | Yes |
Keywords
- IR-69901