HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Temporal aggregation in production planning

Abstract : In this paper, the problem of temporal aggregation in production planning is addresses. A simple facility with multiple part types is considered. The planning horizon consists of a sequence of elementary time periods and the demand for all part types is assumed to be known over these periods. The production planning problem consists of minimizing the holding and backlogging cost for all part types. Due to usual errors in demand forecasting and due to the large size of the linear programming problem commonly encountered in such problems, there is a need for aggregating the production variables over the time horizon (typically, from weekly to monthly) to result in a hierarchical structure. We consider a two-level hierarchy composing a sub-problem at each level and we propose an iterative technique which solves these sub-problems in sequence. A posteriori bounds are developed, which are useful in evaluating the performance of the iterative algorithm. Quick lower and upper bounds of the original problem are also developed. Finally, numerical results for numerous test cases are presented.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:07:54 PM
Last modification on : Friday, February 4, 2022 - 3:23:52 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:27:46 PM


  • HAL Id : inria-00074716, version 1



G. Harhalakis, Anshu Mehra, R. Nagi, Jean-Marie Proth. Temporal aggregation in production planning. [Research Report] RR-1957, INRIA. 1993, pp.38. ⟨inria-00074716⟩



Record views


Files downloads