Within the project preparation phase, experienced professionals manually map design information onto process information with the aim to develop realistic and practical schedules. Unfortunately, the mapping itself is neither part of any underlying data model nor is it supported by current scheduling tools. As a consequence the process of setting up the data model for a schedule is still not supported formally. At Technische Universität Berlin, research activities have been carried out where a complete, correct and consistent process is regarded as a result of a computation that addresses the missing linkage between design and process information. The approach makes use of so called component types. These are template sub-processes that describe the fabrication procedure of typical building components. Decomposing the building into components and assigning a component type to each component allows for formal support while scheduling. Depending on the decomposition of the building into components and the complexity of the involved sub-processes the specification effort differs. The question about optimal sub-processes arises: Which layout of building components and sub-processes results in minimal specification effort? This dissertation presents a branch and bound algorithm to determine optimal decompositions of planning and construction processes into design information and process information. For a given schedule, which has been modelled on a template-based modelling technique, all possible decompositions are determined. During the decomposition process the encountered configurations are compared. Those with minimal specification effort are registered. The knowledge about optimal decompositions is used to improve the basis of process-templates for future projects. Theoretical and practical examples are examined and discussed.
Archived Files and Locations
|application/pdf 2.0 MB ||
access all versions, variants, and formats of this works (eg, pre-prints)