A Multi-objective Stochastic Programming Approach for Project Time, Cost and Quality Trade-off Problem (TCQTP)

Generally, in project time, cost and quality trade-off problems, the decision maker (DM) has to take different conflicting objectives into account in order to find an optimal solution. In project management literature, many models have been developed for project crashing and project time-cost trade-...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Jordan Journal of Civil Engineering Ročník 10; číslo 4
Hlavní autori: Ahadian, Behrooz, Veisy, Omid, Azizi, Vahid
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Irbid Jordan University of Science and Technology 01.01.2016
ISSN:1993-0461, 2225-157X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Generally, in project time, cost and quality trade-off problems, the decision maker (DM) has to take different conflicting objectives into account in order to find an optimal solution. In project management literature, many models have been developed for project crashing and project time-cost trade-off, but only a few of them consider quality as an objective. This article employs a chance constrained compromise programming approach (CCCP) to solve the time, cost and quality trade-off problem (TCQTP). The purpose of this paper is to present and test a new model for the project time, cost and quality problem. In fact, we try to find the optimal decrease in cost and duration of activities while maximizing quality under uncertainty conditions. In order to expect more realistic outcomes for the problem of uncertainties in project activities, time should be taken into account. Therefore, we assume the activity duration as a random and normally distributed parameter. An example of a project network, consisting of 6 nodes and 7 activities, is analyzed under different uncertainty levels.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1993-0461
2225-157X