Search results

Filters

  • Journals
  • Keywords
  • Date

Search results

Number of results: 2
items per page: 25 50 75
Sort by:

Abstract

This paper presents a model of scheduling of multi unit construction project based on an NP-hard permutation flow shop problem, in which the considered criterion is the sum of the costs of the works' execution of the project considering the time of the project as a constraint. It is also assumed that each job in the units constituting the project may be realized in up to three different ways with specific time and cost of execution. The optimization task relies on solving the problem with two different decision variables: the order of execution of units (permutation) and a set of ways to carry out the works in units. The task presented in the paper is performed with the use of a created algorithm which searches the space of solutions in which metaheuristic simulated annealing algorithm is used. The paper presents a calculation example showing the applicability of the model in the optimization of sub-contractors' work in the construction project.
Go to article

Abstract

Production rates for various activities and overall construction project duration are significantly influenced by crew formation. Crews are composed of available renewable resources. Construction companies tend to reduce the number of permanent employees, which reduces fixed costs, but at the same time limits production capacity. Therefore, construction project planning must be carried out by means of scheduling methods which allow for resource constrains. Authors create a mathematical model for optimized scheduling of linear construction projects with consideration of resources and work continuity constraints. Proposed approach enables user to select optimal crew formation under limited resource supply. This minimizes project duration and improves renewable resource utilization in construction linear projects. This paper presents mixed integer linear programming to model this problem and uses a case study to illustrate it.
Go to article

This page uses 'cookies'. Learn more