Bicriteria problem of discrete optimization in planning a multiunit construction project

E-ISSN： 2261-236x|174|issue|04008-04008

ISSN： 2261-236x

Source： MATEC Web of conference, Vol.174, Iss.issue, 2018-06, pp. : 04008-04008

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

The paper describes the bicriteria discrete optimization problem, that may occur during the scheduling of multiunit construction projects. The multiunit project involves the construction of many civil structures with the same sets of activities needed, but different in size. In the project the deadlines of activities in units are adopted. The missing of them by the contractor causes the payment of the disincentive penalty. The early completion of the activities in units is rewarded extra income for the construction contractor i.e. a incentive bonus. Changing the order of the execution of the units changes the value of the objective functions: the duration of the project and the cost (the sum of the disincentive penalties and incentive bonuses). The proposed model of the project is the bicriteria NP-hard flow shop problem with constraints characteristic for construction projects. The paper presents the method of determining the set of Paretooptimal solutions for small projects. The computational example of the model of the project is also included in the paper.