Decomposition and iterative aggregation in hierarchical and decentralised planning structures

The interpretation of decomposition approaches, originally developed for the solution of large-scale programming problems, as a representation of the planning process in a divisionalised enterprise has been treated intensively in literature. In contrast, iterative aggregation and disaggregation is s...

Full description

Saved in:
Bibliographic Details
Main Authors: Jörnsten, Kurt O. (Author) , Leisten, Rainer (Author)
Format: Article (Journal)
Language:English
Published: 5 October 1995
In: European journal of operational research
Year: 1995, Volume: 86, Issue: 1, Pages: 120-141
ISSN:0377-2217
DOI:10.1016/0377-2217(95)00065-X
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/0377-2217(95)00065-X
Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/037722179500065X
Get full text
Author Notes:Kurt Jörnsten, Rainer Leisten
Description
Summary:The interpretation of decomposition approaches, originally developed for the solution of large-scale programming problems, as a representation of the planning process in a divisionalised enterprise has been treated intensively in literature. In contrast, iterative aggregation and disaggregation is seldom discussed with respect to organisational or planning aspects. This paper intends to interpret iterative aggregation in an organisational (divisionalised) context and tries to compare basic decomposition approaches with basic aggregation approaches focusing on the information flow between the different organisational levels. We also present several modifications of the standard aggregation approach and interpret them in an organisational context. The standard block-angular LP-model used implies that the structure of the organisational problem is reduced to a situation in which the co-ordination between the two organisational levels is simplified mainly to a communication process of exchanging information between the different levels.
Item Description:Gesehen am 12.12.2024
Physical Description:Online Resource
ISSN:0377-2217
DOI:10.1016/0377-2217(95)00065-X