A robust critical path in an environment with hybrid uncertainty

[Display omitted] ► We consider the duration of activities as random fuzzy variables. ► We model the problem with chance constraints and a robust optimization criterion. ► An exact algorithm and genetic algorithm are used to find a robust critical path. ► Our method in comparison with simulation met...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied soft computing Jg. 12; H. 3; S. 1087 - 1100
Hauptverfasser: Sadjadi, Seyed Jafar, Pourmoayed, Reza, Aryanezhad, M.B.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.03.2012
Schlagworte:
Critical path method (CPM)
Project management
Random fuzzy variable
Robust optimization
Robust optimization
Critical path method (CPM)
Random fuzzy variable
Project management
ISSN:1568-4946, 1872-9681
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:[Display omitted] ► We consider the duration of activities as random fuzzy variables. ► We model the problem with chance constraints and a robust optimization criterion. ► An exact algorithm and genetic algorithm are used to find a robust critical path. ► Our method in comparison with simulation method, usually gives better answers. In this article, we consider the project critical path problem in an environment with hybrid uncertainty. In this environment, the duration of activities are considered as random fuzzy variables that have probability and fuzzy natures, simultaneously. To obtain a robust critical path with this kind of uncertainty a chance constraints programming model is used. This model is converted to a deterministic model in two stages. In the first stage, the uncertain model is converted to a model with interval parameters by alpha-cut method and distribution function concepts. In the second stage, the interval model is converted to a deterministic model by robust optimization and min–max regret criterion and ultimately a genetic algorithm with a proposed exact algorithm are applied to solve the final model. Finally, some numerical examples are given to show the efficiency of the solution procedure.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2011.11.015